YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:56:24,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:56:24,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:56:24,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:56:24,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:56:24,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:56:24,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:56:24,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:56:24,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:56:24,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:56:24,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:56:24,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:56:24,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:56:24,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:56:24,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:56:24,711 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:56:24,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:56:24,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:56:24,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:56:24,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:56:24,718 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:56:24,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:56:24,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:56:24,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:56:24,721 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:56:24,722 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:56:24,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:56:24,723 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:56:24,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:56:24,724 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:56:24,725 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:56:24,726 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:56:24,727 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:56:24,727 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:56:24,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:56:24,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:56:24,728 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:56:24,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:56:24,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:56:24,730 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:56:24,744 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:56:24,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:56:24,745 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:56:24,745 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:56:24,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:56:24,746 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:56:24,746 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:56:24,746 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:56:24,746 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:56:24,747 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:56:24,747 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:56:24,747 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:56:24,747 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:56:24,747 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:56:24,747 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:56:24,748 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:56:24,748 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:56:24,748 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:56:24,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:56:24,748 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:56:24,748 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:56:24,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:56:24,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:56:24,749 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:56:24,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:56:24,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:56:24,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:56:24,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:56:24,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:56:24,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:56:24,789 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:56:24,792 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:56:24,794 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:56:24,794 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:56:24,795 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:56:24,858 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/d1d5f09fdbb245f49f0d9a8d32e3ad87/FLAGf96ed4775 [2020-06-22 10:56:25,215 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:56:25,215 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:56:25,216 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:56:25,223 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/d1d5f09fdbb245f49f0d9a8d32e3ad87/FLAGf96ed4775 [2020-06-22 10:56:25,638 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/d1d5f09fdbb245f49f0d9a8d32e3ad87 [2020-06-22 10:56:25,657 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:56:25,659 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:56:25,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:56:25,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:56:25,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:56:25,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:56:25" (1/1) ... [2020-06-22 10:56:25,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fae456f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:25, skipping insertion in model container [2020-06-22 10:56:25,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:56:25" (1/1) ... [2020-06-22 10:56:25,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:56:25,715 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:56:25,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:56:25,985 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:56:26,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:56:26,018 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:56:26,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26 WrapperNode [2020-06-22 10:56:26,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:56:26,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:56:26,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:56:26,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:56:26,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:56:26,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:56:26,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:56:26,060 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:56:26,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:56:26,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:56:26,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:56:26,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:56:26,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:56:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:56:26,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:56:26,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:56:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:56:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:56:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:56:26,393 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:56:26,393 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:56:26,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:26 BoogieIcfgContainer [2020-06-22 10:56:26,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:56:26,396 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:56:26,396 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:56:26,399 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:56:26,400 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:26" (1/1) ... [2020-06-22 10:56:26,417 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 20 edges [2020-06-22 10:56:26,418 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:56:26,419 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:56:26,419 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:56:26,420 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:56:26,422 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:56:26,422 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:56:26,423 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:56:26,447 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:56:26,482 INFO L200 BlockEncoder]: SBE split 8 edges [2020-06-22 10:56:26,487 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:56:26,488 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:56:26,507 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 10:56:26,510 INFO L70 RemoveSinkStates]: Removed 17 edges and 2 locations by removing sink states [2020-06-22 10:56:26,513 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:56:26,513 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:56:26,513 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:56:26,514 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:56:26,514 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges [2020-06-22 10:56:26,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:56:26 BasicIcfg [2020-06-22 10:56:26,515 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:56:26,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:56:26,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:56:26,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:56:26,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:56:25" (1/4) ... [2020-06-22 10:56:26,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585be4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:56:26, skipping insertion in model container [2020-06-22 10:56:26,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (2/4) ... [2020-06-22 10:56:26,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585be4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:56:26, skipping insertion in model container [2020-06-22 10:56:26,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:26" (3/4) ... [2020-06-22 10:56:26,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585be4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:56:26, skipping insertion in model container [2020-06-22 10:56:26,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:56:26" (4/4) ... [2020-06-22 10:56:26,523 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:56:26,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:56:26,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-06-22 10:56:26,560 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-06-22 10:56:26,589 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:56:26,589 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:56:26,590 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:56:26,590 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:56:26,590 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:56:26,590 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:56:26,590 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:56:26,590 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:56:26,591 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:56:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-06-22 10:56:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:56:26,612 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:26,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:56:26,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:26,621 INFO L82 PathProgramCache]: Analyzing trace with hash 3794188, now seen corresponding path program 1 times [2020-06-22 10:56:26,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:26,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:26,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:26,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:26,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:26,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:56:26,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:56:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:56:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:26,807 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-06-22 10:56:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:26,879 INFO L93 Difference]: Finished difference Result 12 states and 20 transitions. [2020-06-22 10:56:26,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:56:26,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:56:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:26,895 INFO L225 Difference]: With dead ends: 12 [2020-06-22 10:56:26,896 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 10:56:26,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 10:56:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:56:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:56:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-06-22 10:56:26,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 4 [2020-06-22 10:56:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:26,936 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-06-22 10:56:26,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:56:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. [2020-06-22 10:56:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:56:26,937 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:26,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:56:26,937 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash 3794190, now seen corresponding path program 1 times [2020-06-22 10:56:26,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:26,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:26,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:26,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:26,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:56:26,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:56:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:56:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:56:26,981 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. [2020-06-22 10:56:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,023 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-06-22 10:56:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:56:27,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 10:56:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,024 INFO L225 Difference]: With dead ends: 12 [2020-06-22 10:56:27,025 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 10:56:27,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:56:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 10:56:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:56:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:56:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 10:56:27,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 [2020-06-22 10:56:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,029 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:56:27,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:56:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 10:56:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:56:27,030 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:56:27,030 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,031 INFO L82 PathProgramCache]: Analyzing trace with hash 3794191, now seen corresponding path program 1 times [2020-06-22 10:56:27,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:27,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:56:27,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:56:27,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:56:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:27,061 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2020-06-22 10:56:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,100 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-06-22 10:56:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:56:27,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:56:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,101 INFO L225 Difference]: With dead ends: 11 [2020-06-22 10:56:27,102 INFO L226 Difference]: Without dead ends: 10 [2020-06-22 10:56:27,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-06-22 10:56:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 10:56:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:56:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-06-22 10:56:27,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 4 [2020-06-22 10:56:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,105 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-06-22 10:56:27,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:56:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-06-22 10:56:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:56:27,106 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:56:27,106 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 117620798, now seen corresponding path program 1 times [2020-06-22 10:56:27,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:27,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:56:27,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:56:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:56:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:27,136 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2020-06-22 10:56:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,176 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. [2020-06-22 10:56:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:56:27,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:56:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,177 INFO L225 Difference]: With dead ends: 10 [2020-06-22 10:56:27,177 INFO L226 Difference]: Without dead ends: 9 [2020-06-22 10:56:27,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-06-22 10:56:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 10:56:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 10:56:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-22 10:56:27,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 5 [2020-06-22 10:56:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,180 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 10:56:27,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:56:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2020-06-22 10:56:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:56:27,181 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:56:27,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 117620800, now seen corresponding path program 1 times [2020-06-22 10:56:27,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:27,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:56:27,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:56:27,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:56:27,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:56:27,233 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2020-06-22 10:56:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,273 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-06-22 10:56:27,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:56:27,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:56:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,276 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:56:27,276 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 10:56:27,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:56:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 10:56:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2020-06-22 10:56:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:56:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-06-22 10:56:27,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 5 [2020-06-22 10:56:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,282 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-06-22 10:56:27,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:56:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-06-22 10:56:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:56:27,282 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:56:27,283 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash 117620801, now seen corresponding path program 1 times [2020-06-22 10:56:27,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:27,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:56:27,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:56:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:56:27,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:56:27,335 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2020-06-22 10:56:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,389 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-06-22 10:56:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:56:27,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-06-22 10:56:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,390 INFO L225 Difference]: With dead ends: 14 [2020-06-22 10:56:27,390 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 10:56:27,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:56:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 10:56:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-06-22 10:56:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:56:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-06-22 10:56:27,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 [2020-06-22 10:56:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,394 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-06-22 10:56:27,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:56:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-06-22 10:56:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:56:27,394 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:56:27,395 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1364412798, now seen corresponding path program 1 times [2020-06-22 10:56:27,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:27,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:56:27,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:56:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:56:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:27,424 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 3 states. [2020-06-22 10:56:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,446 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2020-06-22 10:56:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:56:27,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 10:56:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,447 INFO L225 Difference]: With dead ends: 10 [2020-06-22 10:56:27,448 INFO L226 Difference]: Without dead ends: 8 [2020-06-22 10:56:27,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:56:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-06-22 10:56:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-22 10:56:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:56:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-22 10:56:27,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2020-06-22 10:56:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,451 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 10:56:27,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:56:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-06-22 10:56:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:56:27,452 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:56:27,452 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1364414191, now seen corresponding path program 1 times [2020-06-22 10:56:27,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:56:27,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:56:27,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:56:27,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:56:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:56:27,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 10:56:27,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:56:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:56:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:56:27,583 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 6 states. [2020-06-22 10:56:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,636 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-06-22 10:56:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:56:27,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 10:56:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,647 INFO L225 Difference]: With dead ends: 10 [2020-06-22 10:56:27,647 INFO L226 Difference]: Without dead ends: 9 [2020-06-22 10:56:27,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:56:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-06-22 10:56:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-06-22 10:56:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:56:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-06-22 10:56:27,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2020-06-22 10:56:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,651 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-06-22 10:56:27,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:56:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-06-22 10:56:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:56:27,652 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:56:27,653 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1364414192, now seen corresponding path program 1 times [2020-06-22 10:56:27,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:56:27,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 10:56:27,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:56:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:56:27,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:56:27,756 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2020-06-22 10:56:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:27,827 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-06-22 10:56:27,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:56:27,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 10:56:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:27,828 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:56:27,828 INFO L226 Difference]: Without dead ends: 8 [2020-06-22 10:56:27,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:56:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-06-22 10:56:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-22 10:56:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:56:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-06-22 10:56:27,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 [2020-06-22 10:56:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:27,831 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-06-22 10:56:27,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:56:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-06-22 10:56:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:56:27,832 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:27,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:56:27,833 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1822480608, now seen corresponding path program 1 times [2020-06-22 10:56:27,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:27,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:56:27,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:56:27,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:27,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 10:56:27,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:56:28,043 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 10:56:28,044 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:56:28,055 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:28,056 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:56:28,057 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 10:56:28,103 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:28,103 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 10:56:28,107 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:56:28,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:28,125 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:56:28,125 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 10:56:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:28,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:56:28,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-06-22 10:56:28,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 10:56:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:56:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:56:28,194 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 9 states. [2020-06-22 10:56:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:28,376 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-06-22 10:56:28,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:56:28,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2020-06-22 10:56:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:28,377 INFO L225 Difference]: With dead ends: 11 [2020-06-22 10:56:28,377 INFO L226 Difference]: Without dead ends: 10 [2020-06-22 10:56:28,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:56:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-06-22 10:56:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 10:56:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:56:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-06-22 10:56:28,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2020-06-22 10:56:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:28,380 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-06-22 10:56:28,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 10:56:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-06-22 10:56:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 10:56:28,381 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:28,381 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-06-22 10:56:28,381 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash -942818353, now seen corresponding path program 2 times [2020-06-22 10:56:28,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:28,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:28,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:28,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:28,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:28,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:56:28,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:56:28,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:56:28,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:56:28,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:56:28,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 10:56:28,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:56:28,579 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:56:28,580 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:56:28,584 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:28,585 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:56:28,585 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 10:56:28,604 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:56:28,605 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:56:28,611 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:28,611 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:56:28,612 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 10:56:28,645 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:28,645 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 10:56:28,647 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:56:28,658 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:28,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:56:28,661 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 10:56:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:56:28,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:56:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-06-22 10:56:28,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-06-22 10:56:28,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 10:56:28,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-06-22 10:56:28,730 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-06-22 10:56:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:29,155 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-06-22 10:56:29,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 10:56:29,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2020-06-22 10:56:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:29,156 INFO L225 Difference]: With dead ends: 14 [2020-06-22 10:56:29,156 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 10:56:29,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-06-22 10:56:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 10:56:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-06-22 10:56:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:56:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-06-22 10:56:29,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2020-06-22 10:56:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:29,161 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-06-22 10:56:29,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-06-22 10:56:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-06-22 10:56:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:56:29,161 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:56:29,162 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:56:29,162 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:56:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 189636381, now seen corresponding path program 1 times [2020-06-22 10:56:29,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:29,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:29,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:56:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 10:56:29,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:56:29,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:56:29,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:29,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 10:56:29,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:56:29,295 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:56:29,295 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:56:29,304 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:29,305 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:56:29,305 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 10:56:29,311 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:56:29,311 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:56:29,320 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:29,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:56:29,321 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 10:56:29,339 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:29,339 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 10:56:29,341 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:56:29,351 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:56:29,351 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:56:29,351 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 10:56:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 10:56:29,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:56:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-06-22 10:56:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 10:56:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:56:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:56:29,419 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. [2020-06-22 10:56:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:56:29,500 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-06-22 10:56:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:56:29,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-06-22 10:56:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:56:29,501 INFO L225 Difference]: With dead ends: 12 [2020-06-22 10:56:29,501 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:56:29,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-06-22 10:56:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:56:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:56:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:56:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:56:29,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-06-22 10:56:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:56:29,503 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:56:29,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 10:56:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:56:29,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:56:29,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:56:29,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:56:29,702 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-06-22 10:56:29,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:56:29,719 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 15) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 10:56:29,720 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 14) no Hoare annotation was computed. [2020-06-22 10:56:29,721 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 14) the Hoare annotation is: (let ((.cse10 (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base)) (.cse9 (select |#length| ULTIMATE.start_cstrlen_~p~0.base))) (let ((.cse4 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse7 (<= (+ ULTIMATE.start_cstrlen_~p~0.offset 1) .cse9)) (.cse3 (= 0 (select .cse10 (+ .cse9 (- 1))))) (.cse0 (= 0 ULTIMATE.start_cstrlen_~p~0.offset)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse6 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse1 (= ULTIMATE.start_main_~length1~0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (.cse2 (= (select |#valid| ULTIMATE.start_cstrlen_~p~0.base) 1)) (.cse8 (= ULTIMATE.start_cstrlen_~p~0.base ULTIMATE.start_cstrlen_~s.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= 1 ULTIMATE.start_cstrlen_~p~0.offset) .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 .cse8 .cse3) (and (= 1 ULTIMATE.start_main_~length1~0) .cse0 .cse5 (<= 1 .cse9) .cse6 .cse1 .cse2 (= (select .cse10 ULTIMATE.start_cstrlen_~p~0.offset) 0) .cse8)))) [2020-06-22 10:56:29,721 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 14) no Hoare annotation was computed. [2020-06-22 10:56:29,722 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:56:29,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:29,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:29,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:29,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:29,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:29,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:29,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:29,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:56:29 BasicIcfg [2020-06-22 10:56:29,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:56:29,748 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:56:29,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:56:29,751 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:56:29,752 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:56:29,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:56:25" (1/5) ... [2020-06-22 10:56:29,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c4e3c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:56:29, skipping insertion in model container [2020-06-22 10:56:29,753 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:56:29,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:56:26" (2/5) ... [2020-06-22 10:56:29,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c4e3c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:56:29, skipping insertion in model container [2020-06-22 10:56:29,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:56:29,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:56:26" (3/5) ... [2020-06-22 10:56:29,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c4e3c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:56:29, skipping insertion in model container [2020-06-22 10:56:29,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:56:29,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:56:26" (4/5) ... [2020-06-22 10:56:29,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c4e3c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:56:29, skipping insertion in model container [2020-06-22 10:56:29,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:56:29,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:56:29" (5/5) ... [2020-06-22 10:56:29,756 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:56:29,776 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:56:29,776 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:56:29,776 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:56:29,777 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:56:29,777 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:56:29,777 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:56:29,777 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:56:29,777 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:56:29,777 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:56:29,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 10:56:29,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:56:29,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:56:29,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:56:29,790 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:56:29,790 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:56:29,790 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:56:29,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 10:56:29,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:56:29,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:56:29,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:56:29,791 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:56:29,792 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:56:29,797 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue [95] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 14#L20true [56] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 10#L20-2true [66] L20-2-->L24: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_4|) (> |v_ULTIMATE.start_main_#t~malloc3.base_4| 0) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4| 1) |v_#valid_5|) (< |v_ULTIMATE.start_main_#t~malloc3.base_4| |v_#StackHeapBarrier_1|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 11#L24true [96] L24-->L13-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlen_#in~s.offset_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_cstrlen_~s.base_5) (= |v_ULTIMATE.start_cstrlen_#in~s.offset_2| v_ULTIMATE.start_cstrlen_~s.offset_4) (<= 1 .cse0) (= (store |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8 (store (select |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11 (- 1)) 0)) |v_#memory_int_4|) (= v_ULTIMATE.start_cstrlen_~s.base_5 v_ULTIMATE.start_cstrlen_~p~0.base_10) (<= .cse0 (select |v_#length_7| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_cstrlen_~p~0.offset_8 v_ULTIMATE.start_cstrlen_~s.offset_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_8, ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_7|, ULTIMATE.start_cstrlen_~s.base=v_ULTIMATE.start_cstrlen_~s.base_5, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, ULTIMATE.start_cstrlen_#in~s.base=|v_ULTIMATE.start_cstrlen_#in~s.base_2|, ULTIMATE.start_cstrlen_~s.offset=v_ULTIMATE.start_cstrlen_~s.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_10, ULTIMATE.start_cstrlen_#in~s.offset=|v_ULTIMATE.start_cstrlen_#in~s.offset_2|, ULTIMATE.start_cstrlen_#t~post1.offset=|v_ULTIMATE.start_cstrlen_#t~post1.offset_4|, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrlen_#t~post1.base=|v_ULTIMATE.start_cstrlen_#t~post1.base_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~mem0, ULTIMATE.start_cstrlen_~s.base, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#in~s.offset, ULTIMATE.start_cstrlen_#t~post1.offset, ULTIMATE.start_cstrlen_#res, #memory_int, ULTIMATE.start_cstrlen_#t~post1.base, ULTIMATE.start_cstrlen_#in~s.base, ULTIMATE.start_cstrlen_~s.offset] 3#L13-3true [2020-06-22 10:56:29,797 INFO L796 eck$LassoCheckResult]: Loop: 3#L13-3true [44] L13-3-->L13-1: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_cstrlen_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrlen_~p~0.offset_3) (= |v_ULTIMATE.start_cstrlen_#t~mem0_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~p~0.base_3) v_ULTIMATE.start_cstrlen_~p~0.offset_3)) (<= (+ v_ULTIMATE.start_cstrlen_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~p~0.base_3))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_3, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_3, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_2|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_3, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem0] 7#L13-1true [93] L13-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cstrlen_~p~0.base_7 v_ULTIMATE.start_cstrlen_~p~0.base_6) (= v_ULTIMATE.start_cstrlen_~p~0.offset_5 (+ v_ULTIMATE.start_cstrlen_~p~0.offset_6 1)) (< 0 |v_ULTIMATE.start_cstrlen_#t~mem0_6|)) InVars {ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_6|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_6, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_7} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_5, ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_5|, ULTIMATE.start_cstrlen_#t~post1.base=|v_ULTIMATE.start_cstrlen_#t~post1.base_2|, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_6, ULTIMATE.start_cstrlen_#t~post1.offset=|v_ULTIMATE.start_cstrlen_#t~post1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~mem0, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#t~post1.offset, ULTIMATE.start_cstrlen_#t~post1.base] 3#L13-3true [2020-06-22 10:56:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash 3809624, now seen corresponding path program 1 times [2020-06-22 10:56:29,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:29,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:56:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:56:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2418, now seen corresponding path program 1 times [2020-06-22 10:56:29,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:29,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:29,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:56:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:56:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash -633917175, now seen corresponding path program 1 times [2020-06-22 10:56:29,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:56:29,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:56:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:56:29,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:56:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:56:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:56:30,048 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:56:30,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:56:30,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:56:30,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:56:30,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:56:30,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:56:30,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:56:30,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:56:30,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:56:30,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:56:30,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:56:30,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:56:30,496 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:56:30,502 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:56:30,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:56:30,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:56:30,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:56:30,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:56:30,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:56:30,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:56:30,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:56:30,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:56:30,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:56:30,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:56:30,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:56:30,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:56:30,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:56:30,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:56:30,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:56:30,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:56:30,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:56:30,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:56:30,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:56:30,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:56:30,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:56:30,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:56:30,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:56:30,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:56:30,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:56:30,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:56:30,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:56:30,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:56:30,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:56:30,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:56:30,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:56:30,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:56:30,604 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:56:30,619 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:56:30,620 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:56:30,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:56:30,624 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:56:30,625 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:56:30,625 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_1) = -1*ULTIMATE.start_cstrlen_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_1 Supporting invariants [] [2020-06-22 10:56:30,635 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:56:30,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:56:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:30,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:56:30,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:56:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:56:30,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:56:30,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:56:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:56:30,743 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:56:30,747 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-06-22 10:56:30,748 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states. Second operand 4 states. [2020-06-22 10:56:30,827 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 7 states. [2020-06-22 10:56:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:56:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:56:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-06-22 10:56:30,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 10:56:30,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:56:30,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:56:30,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:56:30,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 10:56:30,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:56:30,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. [2020-06-22 10:56:30,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:56:30,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-06-22 10:56:30,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:56:30,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:56:30,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:56:30,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:56:30,843 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:56:30,844 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:56:30,844 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:56:30,844 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:56:30,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:56:30,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:56:30,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:56:30,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:56:30 BasicIcfg [2020-06-22 10:56:30,850 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:56:30,851 INFO L168 Benchmark]: Toolchain (without parser) took 5192.84 ms. Allocated memory was 514.9 MB in the beginning and 631.8 MB in the end (delta: 116.9 MB). Free memory was 439.2 MB in the beginning and 461.2 MB in the end (delta: -22.1 MB). Peak memory consumption was 94.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,851 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:56:30,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.39 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 438.6 MB in the beginning and 529.7 MB in the end (delta: -91.1 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.47 ms. Allocated memory is still 561.5 MB. Free memory was 529.2 MB in the beginning and 527.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,853 INFO L168 Benchmark]: Boogie Preprocessor took 25.53 ms. Allocated memory is still 561.5 MB. Free memory was 527.6 MB in the beginning and 526.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,854 INFO L168 Benchmark]: RCFGBuilder took 310.27 ms. Allocated memory is still 561.5 MB. Free memory was 526.0 MB in the beginning and 510.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,854 INFO L168 Benchmark]: BlockEncodingV2 took 119.11 ms. Allocated memory is still 561.5 MB. Free memory was 510.8 MB in the beginning and 502.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,855 INFO L168 Benchmark]: TraceAbstraction took 3231.11 ms. Allocated memory was 561.5 MB in the beginning and 597.2 MB in the end (delta: 35.7 MB). Free memory was 502.2 MB in the beginning and 450.0 MB in the end (delta: 52.1 MB). Peak memory consumption was 87.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,855 INFO L168 Benchmark]: BuchiAutomizer took 1102.21 ms. Allocated memory was 597.2 MB in the beginning and 631.8 MB in the end (delta: 34.6 MB). Free memory was 450.0 MB in the beginning and 461.2 MB in the end (delta: -11.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:56:30,860 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 20 edges - StatisticsResult: Encoded RCFG 12 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 358.39 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 438.6 MB in the beginning and 529.7 MB in the end (delta: -91.1 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.47 ms. Allocated memory is still 561.5 MB. Free memory was 529.2 MB in the beginning and 527.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.53 ms. Allocated memory is still 561.5 MB. Free memory was 527.6 MB in the beginning and 526.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 310.27 ms. Allocated memory is still 561.5 MB. Free memory was 526.0 MB in the beginning and 510.8 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 119.11 ms. Allocated memory is still 561.5 MB. Free memory was 510.8 MB in the beginning and 502.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3231.11 ms. Allocated memory was 561.5 MB in the beginning and 597.2 MB in the end (delta: 35.7 MB). Free memory was 502.2 MB in the beginning and 450.0 MB in the end (delta: 52.1 MB). Peak memory consumption was 87.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1102.21 ms. Allocated memory was 597.2 MB in the beginning and 631.8 MB in the end (delta: 34.6 MB). Free memory was 450.0 MB in the beginning and 461.2 MB in the end (delta: -11.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-06-22 10:56:30,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:30,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:30,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:30,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:30,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:56:30,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:56:30,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((0 == p && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && p + 1 <= unknown-#length-unknown[p]) && p == s) || ((((((((1 <= p && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && p + 1 <= unknown-#length-unknown[p]) && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && p == s) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1])) || ((((((((1 == length1 && 0 == p) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[p]) && nondetString1 == 0) && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && unknown-#memory_int-unknown[p][p] == 0) && p == s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 5 error locations. SAFE Result, 3.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 147 SDslu, 74 SDs, 0 SdLazy, 307 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 133 HoareAnnotationTreeSize, 1 FomulaSimplifications, 175 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 93 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 93 ConstructedInterpolants, 4 QuantifiedInterpolants, 4793 SizeOfPredicates, 25 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 9/31 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 54 SDslu, 3 SDs, 0 SdLazy, 41 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital111 mio100 ax100 hnf100 lsp94 ukn91 mio100 lsp46 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:56:22.301 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:56:31.109 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check