YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:57:40,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:57:40,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:57:40,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:57:40,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:57:40,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:57:40,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:57:40,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:57:40,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:57:40,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:57:40,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:57:40,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:57:40,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:57:40,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:57:40,650 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:57:40,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:57:40,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:57:40,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:57:40,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:57:40,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:57:40,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:57:40,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:57:40,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:57:40,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:57:40,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:57:40,662 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:57:40,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:57:40,663 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:57:40,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:57:40,664 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:57:40,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:57:40,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:57:40,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:57:40,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:57:40,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:57:40,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:57:40,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:57:40,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:57:40,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:57:40,669 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 09:57:40,684 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:57:40,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:57:40,686 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:57:40,686 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:57:40,686 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:57:40,686 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:57:40,686 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:57:40,687 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:57:40,687 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:57:40,687 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:57:40,687 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:57:40,687 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:57:40,688 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:57:40,688 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:57:40,688 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:57:40,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:57:40,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:57:40,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:57:40,688 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:57:40,689 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:57:40,689 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:57:40,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:57:40,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:57:40,689 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:57:40,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:57:40,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:57:40,690 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:57:40,690 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:57:40,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:57:40,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:57:40,730 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:57:40,734 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:57:40,735 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:57:40,736 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:57:40,736 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:57:40,804 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/60a71546c01946be8a38e39275e2a3f6/FLAG48fe511a0 [2020-06-22 09:57:41,158 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:57:41,159 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:57:41,159 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:57:41,166 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/60a71546c01946be8a38e39275e2a3f6/FLAG48fe511a0 [2020-06-22 09:57:41,560 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/60a71546c01946be8a38e39275e2a3f6 [2020-06-22 09:57:41,572 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:57:41,573 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:57:41,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:57:41,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:57:41,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:57:41,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd083cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41, skipping insertion in model container [2020-06-22 09:57:41,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:57:41,607 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:57:41,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:57:41,834 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:57:41,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:57:41,869 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:57:41,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41 WrapperNode [2020-06-22 09:57:41,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:57:41,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:57:41,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:57:41,871 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:57:41,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:57:41,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:57:41,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:57:41,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:57:41,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (1/1) ... [2020-06-22 09:57:41,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:57:41,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:57:41,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:57:41,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:57:41,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (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 09:57:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:57:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:57:42,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:57:42,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:57:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:57:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:57:42,261 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:57:42,262 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 09:57:42,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:57:42 BoogieIcfgContainer [2020-06-22 09:57:42,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:57:42,264 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:57:42,264 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:57:42,267 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:57:42,267 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:57:42" (1/1) ... [2020-06-22 09:57:42,289 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges [2020-06-22 09:57:42,291 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:57:42,291 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:57:42,292 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:57:42,292 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:57:42,294 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:57:42,295 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:57:42,295 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:57:42,318 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:57:42,343 INFO L200 BlockEncoder]: SBE split 13 edges [2020-06-22 09:57:42,349 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:57:42,350 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:57:42,382 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:57:42,385 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:57:42,387 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:57:42,387 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:57:42,387 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:57:42,388 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:57:42,388 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges [2020-06-22 09:57:42,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:57:42 BasicIcfg [2020-06-22 09:57:42,389 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:57:42,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:57:42,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:57:42,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:57:42,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:57:41" (1/4) ... [2020-06-22 09:57:42,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427e4675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:57:42, skipping insertion in model container [2020-06-22 09:57:42,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (2/4) ... [2020-06-22 09:57:42,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427e4675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:57:42, skipping insertion in model container [2020-06-22 09:57:42,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:57:42" (3/4) ... [2020-06-22 09:57:42,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427e4675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:57:42, skipping insertion in model container [2020-06-22 09:57:42,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:57:42" (4/4) ... [2020-06-22 09:57:42,398 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:57:42,408 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:57:42,416 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-06-22 09:57:42,433 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-06-22 09:57:42,462 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:57:42,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:57:42,463 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:57:42,463 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:57:42,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:57:42,463 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:57:42,464 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:57:42,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:57:42,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:57:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-06-22 09:57:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:57:42,485 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:57:42,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:57:42,486 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:57:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash 841575624, now seen corresponding path program 1 times [2020-06-22 09:57:42,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:42,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:42,657 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 09:57:42,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:57:42,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:57:42,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:57:42,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:57:42,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:57:42,681 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-06-22 09:57:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:57:42,789 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-06-22 09:57:42,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:57:42,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:57:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:57:42,803 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:57:42,804 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:57:42,807 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 09:57:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:57:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:57:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:57:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 09:57:42,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 6 [2020-06-22 09:57:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:57:42,844 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 09:57:42,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:57:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-06-22 09:57:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:57:42,844 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:57:42,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:57:42,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:57:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash 841575626, now seen corresponding path program 1 times [2020-06-22 09:57:42,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:42,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:42,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:42,885 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 09:57:42,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:57:42,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:57:42,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:57:42,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:57:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:57:42,888 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. [2020-06-22 09:57:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:57:43,013 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-06-22 09:57:43,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:57:43,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 09:57:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:57:43,014 INFO L225 Difference]: With dead ends: 41 [2020-06-22 09:57:43,015 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 09:57:43,016 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 09:57:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 09:57:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-06-22 09:57:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:57:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2020-06-22 09:57:43,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 6 [2020-06-22 09:57:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:57:43,023 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2020-06-22 09:57:43,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:57:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2020-06-22 09:57:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:57:43,023 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:57:43,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:57:43,024 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:57:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash 841575627, now seen corresponding path program 1 times [2020-06-22 09:57:43,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:43,076 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 09:57:43,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:57:43,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:57:43,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:57:43,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:57:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:57:43,077 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. [2020-06-22 09:57:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:57:43,148 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-06-22 09:57:43,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:57:43,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 09:57:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:57:43,151 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:57:43,151 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:57:43,152 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 09:57:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:57:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:57:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:57:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-06-22 09:57:43,158 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 6 [2020-06-22 09:57:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:57:43,158 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-06-22 09:57:43,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:57:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-06-22 09:57:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:57:43,159 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:57:43,159 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:57:43,159 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:57:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 808207579, now seen corresponding path program 1 times [2020-06-22 09:57:43,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:43,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:57:43,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:57:43,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:57:43,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:57:43,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:57:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:57:43,216 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2020-06-22 09:57:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:57:43,292 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-06-22 09:57:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:57:43,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 09:57:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:57:43,293 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:57:43,293 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:57:43,294 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 09:57:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:57:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:57:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:57:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:57:43,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-06-22 09:57:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:57:43,295 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:57:43,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:57:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:57:43,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:57:43,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:57:43,363 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 09:57:43,363 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 09:57:43,364 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:57:43,364 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 09:57:43,364 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 15) no Hoare annotation was computed. [2020-06-22 09:57:43,364 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 9 17) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_bubbleSort_~numbers.base) 1) (= ULTIMATE.start_bubbleSort_~numbers.offset 0) (<= (+ (* 4 ULTIMATE.start_bubbleSort_~i~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base))) [2020-06-22 09:57:43,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 24) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:57:43,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:57:43,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:57:43,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:57:43,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:57:43,366 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 10 16) no Hoare annotation was computed. [2020-06-22 09:57:43,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:57:43,366 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 16) the Hoare annotation is: (let ((.cse0 (= (select |#valid| ULTIMATE.start_bubbleSort_~numbers.base) 1)) (.cse1 (= ULTIMATE.start_bubbleSort_~numbers.offset 0)) (.cse2 (<= (+ (* 4 ULTIMATE.start_bubbleSort_~i~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)))) (or (and (<= 8 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) .cse0 .cse1 .cse2) (and .cse0 (= ULTIMATE.start_bubbleSort_~j~0 1) .cse1 .cse2))) [2020-06-22 09:57:43,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:57:43,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:57:43,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:57:43,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:57:43,367 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:57:43,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:43,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:43,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:43,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:43,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:43,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:43,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:57:43 BasicIcfg [2020-06-22 09:57:43,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:57:43,388 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:57:43,388 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:57:43,391 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:57:43,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:57:43,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:57:41" (1/5) ... [2020-06-22 09:57:43,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@483f8e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:57:43, skipping insertion in model container [2020-06-22 09:57:43,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:57:43,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:57:41" (2/5) ... [2020-06-22 09:57:43,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@483f8e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:57:43, skipping insertion in model container [2020-06-22 09:57:43,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:57:43,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:57:42" (3/5) ... [2020-06-22 09:57:43,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@483f8e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:57:43, skipping insertion in model container [2020-06-22 09:57:43,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:57:43,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:57:42" (4/5) ... [2020-06-22 09:57:43,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@483f8e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:57:43, skipping insertion in model container [2020-06-22 09:57:43,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:57:43,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:57:43" (5/5) ... [2020-06-22 09:57:43,396 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:57:43,418 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:57:43,418 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:57:43,418 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:57:43,418 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:57:43,418 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:57:43,418 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:57:43,418 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:57:43,419 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:57:43,419 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:57:43,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-06-22 09:57:43,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 09:57:43,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:57:43,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:57:43,432 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:57:43,432 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 09:57:43,432 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:57:43,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-06-22 09:57:43,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 09:57:43,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:57:43,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:57:43,436 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:57:43,437 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 09:57:43,442 INFO L794 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 21#L22true [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 6#L22-2true [120] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 3#L9-3true [2020-06-22 09:57:43,442 INFO L796 eck$LassoCheckResult]: Loop: 3#L9-3true [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 13#L10-3true [147] L10-3-->L9-3: Formula: (and (< v_ULTIMATE.start_bubbleSort_~i~0_12 v_ULTIMATE.start_bubbleSort_~j~0_20) (= (+ v_ULTIMATE.start_bubbleSort_~i~0_11 1) v_ULTIMATE.start_bubbleSort_~i~0_12)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_12, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_11, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#t~post0] 3#L9-3true [2020-06-22 09:57:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash 172170, now seen corresponding path program 1 times [2020-06-22 09:57:43,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:43,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash 3216, now seen corresponding path program 1 times [2020-06-22 09:57:43,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:43,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:43,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:43,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:43,487 INFO L82 PathProgramCache]: Analyzing trace with hash 165457625, now seen corresponding path program 1 times [2020-06-22 09:57:43,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:43,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:43,551 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:57:43,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:57:43,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:57:43,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:57:43,552 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 09:57:43,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:57:43,553 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:57:43,553 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:57:43,553 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 09:57:43,553 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:57:43,553 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:57:43,571 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 09:57:43,589 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 09:57:43,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:57:43,641 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:57:43,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 09:57:43,651 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:57:43,688 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 09:57:43,688 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 09:57:43,723 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 09:57:43,725 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:57:43,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:57:43,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:57:43,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:57:43,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:57:43,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:57:43,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:57:43,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:57:43,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 09:57:43,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:57:43,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:57:43,728 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 09:57:43,745 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 09:57:43,797 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:57:43,803 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:57:43,805 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 09:57:43,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:43,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:43,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:43,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:43,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:43,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:43,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:43,816 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:57:43,823 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:57:43,823 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 09:57:43,825 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:57:43,825 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 09:57:43,826 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:57:43,827 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2020-06-22 09:57:43,828 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 09:57:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:43,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:57:43,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:43,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:57:43,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:43,883 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 09:57:43,899 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 09:57:43,901 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 09:57:43,902 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states. Second operand 3 states. [2020-06-22 09:57:44,025 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states.. Second operand 3 states. Result 70 states and 115 transitions. Complement of second has 4 states. [2020-06-22 09:57:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 09:57:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:57:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-06-22 09:57:44,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 09:57:44,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:44,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 09:57:44,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:44,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 09:57:44,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:44,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 115 transitions. [2020-06-22 09:57:44,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 09:57:44,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 34 states and 43 transitions. [2020-06-22 09:57:44,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-06-22 09:57:44,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 09:57:44,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2020-06-22 09:57:44,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:57:44,046 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-06-22 09:57:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2020-06-22 09:57:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-06-22 09:57:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 09:57:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2020-06-22 09:57:44,050 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-06-22 09:57:44,050 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-06-22 09:57:44,050 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:57:44,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2020-06-22 09:57:44,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 09:57:44,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:57:44,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:57:44,052 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:57:44,052 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 09:57:44,053 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 153#L22 [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 147#L22-2 [119] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 134#L9-3 [2020-06-22 09:57:44,053 INFO L796 eck$LassoCheckResult]: Loop: 134#L9-3 [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 135#L10-3 [147] L10-3-->L9-3: Formula: (and (< v_ULTIMATE.start_bubbleSort_~i~0_12 v_ULTIMATE.start_bubbleSort_~j~0_20) (= (+ v_ULTIMATE.start_bubbleSort_~i~0_11 1) v_ULTIMATE.start_bubbleSort_~i~0_12)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_12, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_11, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#t~post0] 134#L9-3 [2020-06-22 09:57:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash 172169, now seen corresponding path program 1 times [2020-06-22 09:57:44,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash 3216, now seen corresponding path program 2 times [2020-06-22 09:57:44,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:44,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,076 INFO L82 PathProgramCache]: Analyzing trace with hash 165456664, now seen corresponding path program 1 times [2020-06-22 09:57:44,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:57:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,122 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:57:44,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:57:44,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:57:44,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:57:44,123 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 09:57:44,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:57:44,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:57:44,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:57:44,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 09:57:44,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:57:44,123 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:57:44,124 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 09:57:44,134 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 09:57:44,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:57:44,172 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:57:44,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 09:57:44,176 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:57:44,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 09:57:44,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 09:57:44,242 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 09:57:44,244 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:57:44,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:57:44,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:57:44,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:57:44,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:57:44,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:57:44,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:57:44,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:57:44,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 09:57:44,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:57:44,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:57:44,246 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 09:57:44,249 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 09:57:44,290 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:57:44,291 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:57:44,291 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 09:57:44,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:44,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:44,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:44,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:44,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:44,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:44,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:44,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:44,294 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 09:57:44,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:44,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:44,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:44,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:44,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:44,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:44,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:44,301 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:57:44,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:57:44,304 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 09:57:44,304 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:57:44,304 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 09:57:44,305 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:57:44,305 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2020-06-22 09:57:44,305 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 09:57:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:44,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:57:44,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:44,341 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:57:44,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:44,354 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 09:57:44,367 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 09:57:44,368 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 09:57:44,368 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 09:57:44,399 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 44 states and 56 transitions. Complement of second has 4 states. [2020-06-22 09:57:44,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 09:57:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:57:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-06-22 09:57:44,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 09:57:44,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:44,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 09:57:44,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:44,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 09:57:44,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:44,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2020-06-22 09:57:44,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-06-22 09:57:44,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 56 transitions. [2020-06-22 09:57:44,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-06-22 09:57:44,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 09:57:44,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2020-06-22 09:57:44,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:57:44,409 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-06-22 09:57:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2020-06-22 09:57:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2020-06-22 09:57:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:57:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-06-22 09:57:44,412 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-06-22 09:57:44,412 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-06-22 09:57:44,412 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:57:44,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-06-22 09:57:44,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:57:44,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:57:44,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:57:44,413 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:57:44,414 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:57:44,414 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 263#L22 [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 259#L22-2 [120] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 247#L9-3 [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 249#L10-3 [2020-06-22 09:57:44,414 INFO L796 eck$LassoCheckResult]: Loop: 249#L10-3 [84] L10-3-->L11: Formula: (<= v_ULTIMATE.start_bubbleSort_~j~0_5 v_ULTIMATE.start_bubbleSort_~i~0_7) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} AuxVars[] AssignedVars[] 251#L11 [90] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= 4 .cse0) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_bubbleSort_~numbers.base_3) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1 (- 4))) |v_ULTIMATE.start_bubbleSort_#t~mem2_2|)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2] 260#L11-1 [86] L11-1-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_bubbleSort_~numbers.base_6) .cse0) |v_ULTIMATE.start_bubbleSort_#t~mem3_2|) (= (select |v_#valid_7| v_ULTIMATE.start_bubbleSort_~numbers.base_6) 1) (<= (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_bubbleSort_~numbers.base_6))))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem3] 255#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_bubbleSort_#t~mem3_6| |v_ULTIMATE.start_bubbleSort_#t~mem2_6|) InVars {ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_6|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_6|} OutVars{ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_5|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3] 253#L10-2 [85] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_bubbleSort_~j~0_18 (+ v_ULTIMATE.start_bubbleSort_~j~0_19 1)) InVars {ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_19} OutVars{ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_18} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_~j~0] 249#L10-3 [2020-06-22 09:57:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 5337338, now seen corresponding path program 1 times [2020-06-22 09:57:44,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash 108972246, now seen corresponding path program 1 times [2020-06-22 09:57:44,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1484393341, now seen corresponding path program 1 times [2020-06-22 09:57:44,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:44,481 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 09:57:44,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:57:44,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:57:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:57:44,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:57:44,536 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-06-22 09:57:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:57:44,600 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-06-22 09:57:44,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:57:44,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2020-06-22 09:57:44,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:57:44,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 29 transitions. [2020-06-22 09:57:44,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:57:44,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 09:57:44,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2020-06-22 09:57:44,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:57:44,606 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-06-22 09:57:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2020-06-22 09:57:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:57:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:57:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2020-06-22 09:57:44,608 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-06-22 09:57:44,609 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-06-22 09:57:44,609 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:57:44,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2020-06-22 09:57:44,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:57:44,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:57:44,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:57:44,610 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:57:44,610 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:57:44,610 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 332#L22 [102] L22-->L22-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 328#L22-2 [120] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 316#L9-3 [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 318#L10-3 [2020-06-22 09:57:44,612 INFO L796 eck$LassoCheckResult]: Loop: 318#L10-3 [84] L10-3-->L11: Formula: (<= v_ULTIMATE.start_bubbleSort_~j~0_5 v_ULTIMATE.start_bubbleSort_~i~0_7) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} AuxVars[] AssignedVars[] 320#L11 [90] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= 4 .cse0) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_bubbleSort_~numbers.base_3) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1 (- 4))) |v_ULTIMATE.start_bubbleSort_#t~mem2_2|)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2] 329#L11-1 [86] L11-1-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_bubbleSort_~numbers.base_6) .cse0) |v_ULTIMATE.start_bubbleSort_#t~mem3_2|) (= (select |v_#valid_7| v_ULTIMATE.start_bubbleSort_~numbers.base_6) 1) (<= (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_bubbleSort_~numbers.base_6))))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem3] 324#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_bubbleSort_#t~mem3_6| |v_ULTIMATE.start_bubbleSort_#t~mem2_6|) InVars {ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_6|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_6|} OutVars{ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_5|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3] 322#L10-2 [85] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_bubbleSort_~j~0_18 (+ v_ULTIMATE.start_bubbleSort_~j~0_19 1)) InVars {ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_19} OutVars{ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_18} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_~j~0] 318#L10-3 [2020-06-22 09:57:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash 5345026, now seen corresponding path program 1 times [2020-06-22 09:57:44,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,626 INFO L82 PathProgramCache]: Analyzing trace with hash 108972246, now seen corresponding path program 2 times [2020-06-22 09:57:44,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:57:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1752993163, now seen corresponding path program 1 times [2020-06-22 09:57:44,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:57:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:57:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:57:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:57:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:57:44,832 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-06-22 09:57:44,881 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:57:44,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:57:44,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:57:44,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:57:44,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:57:44,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:57:44,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:57:44,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:57:44,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:57:44,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:57:44,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:57:44,886 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 09:57:44,888 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 09:57:44,890 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 09:57:44,891 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 09:57:44,893 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 09:57:44,896 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 09:57:44,897 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 09:57:44,899 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 09:57:45,043 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 09:57:45,045 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 09:57:45,047 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 09:57:45,048 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 09:57:45,267 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:57:45,267 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:57:45,268 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 09:57:45,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:45,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:45,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:45,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:45,270 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 09:57:45,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:45,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:45,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:45,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:45,273 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 09:57:45,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:45,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:45,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:45,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:45,275 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 09:57:45,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:45,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:45,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:45,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:45,278 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 09:57:45,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:57:45,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:57:45,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:45,285 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 09:57:45,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:45,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:45,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:45,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:45,287 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 09:57:45,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:57:45,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:57:45,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:57:45,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:57:45,290 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 09:57:45,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:57:45,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:57:45,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:57:45,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:57:45,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:57:45,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:57:45,341 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:57:45,374 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 09:57:45,374 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2020-06-22 09:57:45,375 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:57:45,376 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:57:45,377 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:57:45,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2020-06-22 09:57:45,387 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 09:57:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:57:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:45,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:57:45,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:45,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:57:45,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:45,442 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 09:57:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:45,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:57:45,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:57:45,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:57:45,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:57:45,559 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 09:57:45,559 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 09:57:45,559 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-06-22 09:57:45,642 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 41 states and 50 transitions. Complement of second has 6 states. [2020-06-22 09:57:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 09:57:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:57:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2020-06-22 09:57:45,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 5 letters. [2020-06-22 09:57:45,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:45,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 9 letters. Loop has 5 letters. [2020-06-22 09:57:45,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:45,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 10 letters. [2020-06-22 09:57:45,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:57:45,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2020-06-22 09:57:45,649 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:57:45,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-06-22 09:57:45,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:57:45,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:57:45,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:57:45,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:57:45,650 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:57:45,650 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:57:45,650 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:57:45,650 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:57:45,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:57:45,650 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:57:45,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:57:45,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:57:45 BasicIcfg [2020-06-22 09:57:45,656 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:57:45,657 INFO L168 Benchmark]: Toolchain (without parser) took 4084.81 ms. Allocated memory was 514.9 MB in the beginning and 640.7 MB in the end (delta: 125.8 MB). Free memory was 439.5 MB in the beginning and 601.4 MB in the end (delta: -161.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:57:45,658 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 460.1 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:57:45,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.68 ms. Allocated memory was 514.9 MB in the beginning and 562.6 MB in the end (delta: 47.7 MB). Free memory was 438.8 MB in the beginning and 530.1 MB in the end (delta: -91.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:57:45,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.86 ms. Allocated memory is still 562.6 MB. Free memory was 530.1 MB in the beginning and 528.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:57:45,659 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 ms. Allocated memory is still 562.6 MB. Free memory was 528.0 MB in the beginning and 526.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:57:45,660 INFO L168 Benchmark]: RCFGBuilder took 322.78 ms. Allocated memory is still 562.6 MB. Free memory was 526.7 MB in the beginning and 506.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:57:45,661 INFO L168 Benchmark]: BlockEncodingV2 took 124.99 ms. Allocated memory is still 562.6 MB. Free memory was 506.8 MB in the beginning and 498.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 09:57:45,661 INFO L168 Benchmark]: TraceAbstraction took 997.26 ms. Allocated memory is still 562.6 MB. Free memory was 498.0 MB in the beginning and 413.1 MB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:57:45,662 INFO L168 Benchmark]: BuchiAutomizer took 2268.71 ms. Allocated memory was 562.6 MB in the beginning and 640.7 MB in the end (delta: 78.1 MB). Free memory was 413.1 MB in the beginning and 601.4 MB in the end (delta: -188.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:57:45,666 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 38 edges - StatisticsResult: Encoded RCFG 25 locations, 41 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 460.1 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.68 ms. Allocated memory was 514.9 MB in the beginning and 562.6 MB in the end (delta: 47.7 MB). Free memory was 438.8 MB in the beginning and 530.1 MB in the end (delta: -91.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.86 ms. Allocated memory is still 562.6 MB. Free memory was 530.1 MB in the beginning and 528.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.19 ms. Allocated memory is still 562.6 MB. Free memory was 528.0 MB in the beginning and 526.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 322.78 ms. Allocated memory is still 562.6 MB. Free memory was 526.7 MB in the beginning and 506.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 124.99 ms. Allocated memory is still 562.6 MB. Free memory was 506.8 MB in the beginning and 498.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 997.26 ms. Allocated memory is still 562.6 MB. Free memory was 498.0 MB in the beginning and 413.1 MB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2268.71 ms. Allocated memory was 562.6 MB in the beginning and 640.7 MB in the end (delta: 78.1 MB). Free memory was 413.1 MB in the beginning and 601.4 MB in the end (delta: -188.3 MB). There was no memory consumed. 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 #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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-06-22 09:57:45,674 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:45,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (\valid[numbers] == 1 && numbers == 0) && 4 * i + 4 <= unknown-#length-unknown[numbers] - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 09:57:45,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:45,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:45,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:57:45,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((8 <= numbers + 4 * j && \valid[numbers] == 1) && numbers == 0) && 4 * i + 4 <= unknown-#length-unknown[numbers]) || (((\valid[numbers] == 1 && j == 1) && numbers == 0) && 4 * i + 4 <= unknown-#length-unknown[numbers]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 12 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 122 SDslu, 18 SDs, 0 SdLazy, 135 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 65 HoareAnnotationTreeSize, 2 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 71 SDtfs, 189 SDslu, 72 SDs, 0 SdLazy, 178 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp99 ukn98 mio100 lsp92 div100 bol100 ite100 ukn100 eq166 hnf91 smp89 dnf100 smp100 tf107 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:57:38.273 ----------------------------------------------- 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 09:57:45.902 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check