YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:45:24,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:45:24,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:45:24,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:45:24,647 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:45:24,648 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:45:24,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:45:24,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:45:24,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:45:24,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:45:24,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:45:24,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:45:24,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:45:24,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:45:24,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:45:24,657 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:45:24,658 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:45:24,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:45:24,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:45:24,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:45:24,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:45:24,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:45:24,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:45:24,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:45:24,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:45:24,668 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:45:24,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:45:24,669 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:45:24,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:45:24,670 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:45:24,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:45:24,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:45:24,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:45:24,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:45:24,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:45:24,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:45:24,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:45:24,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:45:24,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:45:24,675 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:45:24,690 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:45:24,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:45:24,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:45:24,691 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:45:24,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:45:24,691 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:45:24,692 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:45:24,692 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:45:24,692 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:45:24,692 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:45:24,692 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:45:24,692 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:45:24,693 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:45:24,693 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:45:24,693 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:45:24,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:45:24,693 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:45:24,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:45:24,694 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:45:24,694 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:45:24,694 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:45:24,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:45:24,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:45:24,694 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:45:24,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:45:24,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:45:24,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:45:24,695 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:45:24,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:45:24,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:45:24,732 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:45:24,736 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:45:24,737 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:45:24,738 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:45:24,738 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:45:24,803 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e0f3305448b24c1aad89b5633719d8c7/FLAG07d42a951 [2020-06-22 08:45:25,154 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:45:25,155 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:45:25,155 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:45:25,163 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e0f3305448b24c1aad89b5633719d8c7/FLAG07d42a951 [2020-06-22 08:45:25,547 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e0f3305448b24c1aad89b5633719d8c7 [2020-06-22 08:45:25,558 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:45:25,560 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:45:25,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:45:25,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:45:25,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:45:25,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9ca0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25, skipping insertion in model container [2020-06-22 08:45:25,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:45:25,594 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:45:25,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:45:25,834 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:45:25,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:45:25,871 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:45:25,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25 WrapperNode [2020-06-22 08:45:25,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:45:25,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:45:25,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:45:25,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:45:25,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:45:25,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:45:25,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:45:25,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:45:25,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (1/1) ... [2020-06-22 08:45:25,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:45:25,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:45:25,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:45:25,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:45:25,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (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 08:45:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:45:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:45:26,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:45:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:45:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:45:26,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:45:26,281 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:45:26,282 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 08:45:26,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:45:26 BoogieIcfgContainer [2020-06-22 08:45:26,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:45:26,284 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:45:26,284 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:45:26,286 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:45:26,287 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:45:26" (1/1) ... [2020-06-22 08:45:26,308 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges [2020-06-22 08:45:26,309 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:45:26,310 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:45:26,311 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:45:26,311 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:45:26,313 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:45:26,314 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:45:26,314 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:45:26,340 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:45:26,366 INFO L200 BlockEncoder]: SBE split 13 edges [2020-06-22 08:45:26,371 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 08:45:26,373 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:45:26,400 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 08:45:26,402 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 08:45:26,404 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:45:26,404 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:45:26,404 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:45:26,405 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:45:26,405 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges [2020-06-22 08:45:26,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:45:26 BasicIcfg [2020-06-22 08:45:26,406 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:45:26,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:45:26,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:45:26,410 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:45:26,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:45:25" (1/4) ... [2020-06-22 08:45:26,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af4387e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:45:26, skipping insertion in model container [2020-06-22 08:45:26,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (2/4) ... [2020-06-22 08:45:26,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af4387e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:45:26, skipping insertion in model container [2020-06-22 08:45:26,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:45:26" (3/4) ... [2020-06-22 08:45:26,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af4387e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:45:26, skipping insertion in model container [2020-06-22 08:45:26,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:45:26" (4/4) ... [2020-06-22 08:45:26,414 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:45:26,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:45:26,433 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-06-22 08:45:26,450 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-06-22 08:45:26,478 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:45:26,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:45:26,479 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:45:26,479 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:45:26,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:45:26,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:45:26,480 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:45:26,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:45:26,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:45:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-06-22 08:45:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:45:26,501 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:26,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:45:26,502 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash 851781916, now seen corresponding path program 1 times [2020-06-22 08:45:26,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:26,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:26,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:26,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:26,703 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 08:45:26,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:26,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:45:26,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:45:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:45:26,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:45:26,728 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2020-06-22 08:45:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:26,942 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2020-06-22 08:45:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:45:26,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 08:45:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:26,956 INFO L225 Difference]: With dead ends: 40 [2020-06-22 08:45:26,956 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 08:45:26,959 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 08:45:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 08:45:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2020-06-22 08:45:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:45:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2020-06-22 08:45:26,998 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 6 [2020-06-22 08:45:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:26,999 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2020-06-22 08:45:27,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:45:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2020-06-22 08:45:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:45:27,000 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:27,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:45:27,001 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash 851781917, now seen corresponding path program 1 times [2020-06-22 08:45:27,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:27,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:27,041 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 08:45:27,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:27,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:45:27,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:45:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:45:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:45:27,044 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2020-06-22 08:45:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:27,228 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2020-06-22 08:45:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:45:27,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 08:45:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:27,230 INFO L225 Difference]: With dead ends: 50 [2020-06-22 08:45:27,230 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 08:45:27,231 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 08:45:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 08:45:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2020-06-22 08:45:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 08:45:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 67 transitions. [2020-06-22 08:45:27,239 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 67 transitions. Word has length 6 [2020-06-22 08:45:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:27,239 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 67 transitions. [2020-06-22 08:45:27,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:45:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 67 transitions. [2020-06-22 08:45:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:45:27,240 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:27,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:45:27,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 851781914, now seen corresponding path program 1 times [2020-06-22 08:45:27,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:27,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:27,267 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 08:45:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:27,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:45:27,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:45:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:45:27,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:45:27,268 INFO L87 Difference]: Start difference. First operand 34 states and 67 transitions. Second operand 3 states. [2020-06-22 08:45:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:27,325 INFO L93 Difference]: Finished difference Result 34 states and 67 transitions. [2020-06-22 08:45:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:45:27,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:45:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:27,328 INFO L225 Difference]: With dead ends: 34 [2020-06-22 08:45:27,328 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 08:45:27,328 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 08:45:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 08:45:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 08:45:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:45:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2020-06-22 08:45:27,335 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 6 [2020-06-22 08:45:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:27,335 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-06-22 08:45:27,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:45:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2020-06-22 08:45:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:45:27,336 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:27,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:45:27,336 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:27,337 INFO L82 PathProgramCache]: Analyzing trace with hash 851782130, now seen corresponding path program 1 times [2020-06-22 08:45:27,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:27,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:27,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:27,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:27,365 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 08:45:27,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:27,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:45:27,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:45:27,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:45:27,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:45:27,367 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 3 states. [2020-06-22 08:45:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:27,429 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2020-06-22 08:45:27,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:45:27,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:45:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:27,430 INFO L225 Difference]: With dead ends: 49 [2020-06-22 08:45:27,430 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:45:27,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:45:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:45:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 08:45:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 08:45:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2020-06-22 08:45:27,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 6 [2020-06-22 08:45:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:27,437 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2020-06-22 08:45:27,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:45:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2020-06-22 08:45:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 08:45:27,438 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:27,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:27,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:27,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash 635434233, now seen corresponding path program 1 times [2020-06-22 08:45:27,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:27,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:27,520 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 08:45:27,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:27,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:45:27,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:45:27,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:45:27,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:45:27,522 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 5 states. [2020-06-22 08:45:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:27,697 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2020-06-22 08:45:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:45:27,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 08:45:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:27,698 INFO L225 Difference]: With dead ends: 49 [2020-06-22 08:45:27,698 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 08:45:27,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:45:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 08:45:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2020-06-22 08:45:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 08:45:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2020-06-22 08:45:27,706 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 7 [2020-06-22 08:45:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:27,706 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2020-06-22 08:45:27,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:45:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2020-06-22 08:45:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:45:27,707 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:27,707 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:27,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1472327545, now seen corresponding path program 1 times [2020-06-22 08:45:27,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:27,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:27,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:27,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:45:27,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:45:27,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:45:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:27,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:27,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 08:45:27,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 08:45:27,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2020-06-22 08:45:27,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:45:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:45:27,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:45:27,870 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand 7 states. [2020-06-22 08:45:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:27,994 INFO L93 Difference]: Finished difference Result 76 states and 109 transitions. [2020-06-22 08:45:27,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:45:27,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-06-22 08:45:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:27,997 INFO L225 Difference]: With dead ends: 76 [2020-06-22 08:45:27,997 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 08:45:27,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:45:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 08:45:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 08:45:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 08:45:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2020-06-22 08:45:28,004 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 12 [2020-06-22 08:45:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:28,004 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2020-06-22 08:45:28,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:45:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2020-06-22 08:45:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:45:28,005 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:28,005 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:28,005 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1903912626, now seen corresponding path program 1 times [2020-06-22 08:45:28,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:45:28,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:45:28,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:45:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:45:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:45:28,049 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 5 states. [2020-06-22 08:45:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:28,133 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2020-06-22 08:45:28,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:45:28,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-06-22 08:45:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:28,134 INFO L225 Difference]: With dead ends: 62 [2020-06-22 08:45:28,134 INFO L226 Difference]: Without dead ends: 59 [2020-06-22 08:45:28,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:45:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-06-22 08:45:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2020-06-22 08:45:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-06-22 08:45:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2020-06-22 08:45:28,142 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 12 [2020-06-22 08:45:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:28,142 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2020-06-22 08:45:28,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:45:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2020-06-22 08:45:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:45:28,143 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:28,143 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:28,143 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1903912625, now seen corresponding path program 1 times [2020-06-22 08:45:28,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:45:28,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:45:28,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:45:28,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:28,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:45:28,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:45:28,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:45:28,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2020-06-22 08:45:28,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:45:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:45:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:45:28,285 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 7 states. [2020-06-22 08:45:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:28,388 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. [2020-06-22 08:45:28,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:45:28,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-06-22 08:45:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:28,389 INFO L225 Difference]: With dead ends: 66 [2020-06-22 08:45:28,389 INFO L226 Difference]: Without dead ends: 60 [2020-06-22 08:45:28,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:45:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-06-22 08:45:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2020-06-22 08:45:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 08:45:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2020-06-22 08:45:28,396 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 12 [2020-06-22 08:45:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:28,397 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-06-22 08:45:28,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:45:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-06-22 08:45:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:45:28,397 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:28,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:28,398 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1903903725, now seen corresponding path program 1 times [2020-06-22 08:45:28,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:45:28,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:28,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:45:28,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:45:28,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:45:28,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:45:28,431 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2020-06-22 08:45:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:28,481 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-06-22 08:45:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:45:28,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 08:45:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:28,483 INFO L225 Difference]: With dead ends: 43 [2020-06-22 08:45:28,483 INFO L226 Difference]: Without dead ends: 41 [2020-06-22 08:45:28,483 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 08:45:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-06-22 08:45:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2020-06-22 08:45:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 08:45:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-06-22 08:45:28,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 12 [2020-06-22 08:45:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:28,488 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-06-22 08:45:28,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:45:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-06-22 08:45:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 08:45:28,489 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:28,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:28,490 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1878796187, now seen corresponding path program 1 times [2020-06-22 08:45:28,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:28,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:45:28,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:45:28,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:45:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:28,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:45:28,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:45:28,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 08:45:28,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:45:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:45:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:45:28,611 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 6 states. [2020-06-22 08:45:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:28,682 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2020-06-22 08:45:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:45:28,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-06-22 08:45:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:28,683 INFO L225 Difference]: With dead ends: 67 [2020-06-22 08:45:28,683 INFO L226 Difference]: Without dead ends: 49 [2020-06-22 08:45:28,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:45:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-06-22 08:45:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2020-06-22 08:45:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 08:45:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2020-06-22 08:45:28,695 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 22 [2020-06-22 08:45:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:28,696 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2020-06-22 08:45:28,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:45:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2020-06-22 08:45:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-06-22 08:45:28,697 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:45:28,697 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:28,697 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 08:45:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1703778447, now seen corresponding path program 2 times [2020-06-22 08:45:28,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:28,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:28,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:28,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 08:45:28,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:45:28,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:45:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:45:28,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-06-22 08:45:28,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:45:28,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 08:45:28,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:28,830 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-06-22 08:45:28,830 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:45:28,843 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:45:28,845 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:45:28,845 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-06-22 08:45:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 08:45:28,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:45:28,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2020-06-22 08:45:28,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:45:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:45:28,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:45:28,946 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. [2020-06-22 08:45:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:29,027 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-06-22 08:45:29,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:45:29,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-06-22 08:45:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:45:29,028 INFO L225 Difference]: With dead ends: 39 [2020-06-22 08:45:29,029 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:45:29,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:45:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:45:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:45:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:45:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:45:29,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-06-22 08:45:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:45:29,030 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:45:29,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:45:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:45:29,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:45:29,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:45:29,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:45:29,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:45:29,674 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-06-22 08:45:29,920 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2020-06-22 08:45:29,922 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:45:29,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 08:45:29,924 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 08:45:29,925 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2020-06-22 08:45:29,925 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 16) no Hoare annotation was computed. [2020-06-22 08:45:29,925 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 16) the Hoare annotation is: (and (exists ((ULTIMATE.start_main_~array_size~0 Int)) (and (<= (+ ULTIMATE.start_SelectionSort_~i~0 2) ULTIMATE.start_main_~array_size~0) (= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* 4 ULTIMATE.start_main_~array_size~0)))) (let ((.cse0 (<= (+ ULTIMATE.start_SelectionSort_~min~0 1) ULTIMATE.start_SelectionSort_~j~0)) (.cse2 (* 4 ULTIMATE.start_SelectionSort_~min~0)) (.cse5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (.cse1 (<= 0 ULTIMATE.start_SelectionSort_~i~0)) (.cse3 (= ULTIMATE.start_SelectionSort_~a.offset 0)) (.cse4 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse6 (= (select |#valid| ULTIMATE.start_SelectionSort_~a.base) 1))) (or (and .cse0 .cse1 (<= 0 (+ ULTIMATE.start_SelectionSort_~a.offset .cse2)) .cse3 .cse4 (<= (+ ULTIMATE.start_SelectionSort_~a.offset .cse2 8) .cse5) .cse6) (and .cse0 (<= (+ ULTIMATE.start_SelectionSort_~a.offset .cse2 4) .cse5) .cse1 (<= 1 ULTIMATE.start_SelectionSort_~min~0) .cse3 .cse4 .cse6))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~j~0) (exists ((ULTIMATE.start_main_~array_size~0 Int)) (and (= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_SelectionSort_~array_size ULTIMATE.start_main_~array_size~0)))) [2020-06-22 08:45:29,925 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 12 16) no Hoare annotation was computed. [2020-06-22 08:45:29,926 INFO L444 ceAbstractionStarter]: At program point L8-2(lines 8 21) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_SelectionSort_~a.offset 0)) (.cse6 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse7 (= (select |#valid| ULTIMATE.start_SelectionSort_~a.base) 1)) (.cse8 (* 4 ULTIMATE.start_SelectionSort_~min~0)) (.cse0 (select |#length| ULTIMATE.start_SelectionSort_~a.base))) (let ((.cse1 (<= (+ ULTIMATE.start_SelectionSort_~a.offset .cse8 4) .cse0)) (.cse3 (and (<= (+ ULTIMATE.start_SelectionSort_~min~0 1) ULTIMATE.start_SelectionSort_~j~0) (<= 0 ULTIMATE.start_SelectionSort_~i~0) (<= (* 4 ULTIMATE.start_SelectionSort_~array_size) .cse0) (<= 0 (+ ULTIMATE.start_SelectionSort_~a.offset .cse8)) .cse5 .cse6 .cse7)) (.cse2 (exists ((ULTIMATE.start_main_~array_size~0 Int)) (and (= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_SelectionSort_~array_size ULTIMATE.start_main_~array_size~0))))) (or (and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~i~0) ULTIMATE.start_SelectionSort_~a.offset 4) .cse0) .cse1 .cse2 .cse3) (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~i~0 1))) (and (<= ULTIMATE.start_SelectionSort_~array_size .cse4) .cse1 (<= ULTIMATE.start_SelectionSort_~j~0 .cse4) .cse3)) (and (= 0 ULTIMATE.start_SelectionSort_~i~0) (<= 4 .cse0) .cse5 .cse6 .cse2 .cse7)))) [2020-06-22 08:45:29,926 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:45:29,934 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:29,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:29,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:45:29 BasicIcfg [2020-06-22 08:45:29,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:45:29,960 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:45:29,960 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:45:29,964 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:45:29,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:45:29,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:45:25" (1/5) ... [2020-06-22 08:45:29,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9461da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:45:29, skipping insertion in model container [2020-06-22 08:45:29,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:45:29,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:45:25" (2/5) ... [2020-06-22 08:45:29,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9461da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:45:29, skipping insertion in model container [2020-06-22 08:45:29,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:45:29,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:45:26" (3/5) ... [2020-06-22 08:45:29,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9461da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:45:29, skipping insertion in model container [2020-06-22 08:45:29,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:45:29,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:45:26" (4/5) ... [2020-06-22 08:45:29,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9461da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:45:29, skipping insertion in model container [2020-06-22 08:45:29,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:45:29,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:45:29" (5/5) ... [2020-06-22 08:45:29,969 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:45:29,990 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:45:29,990 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:45:29,990 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:45:29,990 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:45:29,990 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:45:29,990 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:45:29,990 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:45:29,990 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:45:29,991 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:45:29,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-06-22 08:45:29,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:45:29,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:45:29,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:45:30,003 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 08:45:30,003 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:45:30,003 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:45:30,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-06-22 08:45:30,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:45:30,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:45:30,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:45:30,005 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 08:45:30,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:45:30,010 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [146] ULTIMATE.startENTRY-->L26: 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] 17#L26true [103] L26-->L26-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[] 27#L26-2true [121] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (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_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) 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_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 18#L8-2true [2020-06-22 08:45:30,011 INFO L796 eck$LassoCheckResult]: Loop: 18#L8-2true [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 24#L12-3true [106] L12-3-->L12-4: Formula: (>= v_ULTIMATE.start_SelectionSort_~j~0_4 v_ULTIMATE.start_SelectionSort_~array_size_5) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} AuxVars[] AssignedVars[] 21#L12-4true [149] L12-4-->L19: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_14))) (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1))) (and (= v_ULTIMATE.start_SelectionSort_~temp~0_5 (select (select |v_#memory_int_9| v_ULTIMATE.start_SelectionSort_~a.base_21) .cse0)) (<= (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1 4) (select |v_#length_15| v_ULTIMATE.start_SelectionSort_~a.base_21)) (<= 0 .cse0) (= 1 (select |v_#valid_25| v_ULTIMATE.start_SelectionSort_~a.base_21))))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_5, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~mem4] 23#L19true [94] L19-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_SelectionSort_~a.base_12)) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_SelectionSort_~a.base_12)) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_SelectionSort_~a.base_12) .cse1) |v_ULTIMATE.start_SelectionSort_#t~mem5_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5] 20#L19-1true [151] L19-1-->L20: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_16))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_SelectionSort_~a.base_22)) (<= 0 .cse1) (= 1 (select |v_#valid_28| v_ULTIMATE.start_SelectionSort_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22) .cse1 |v_ULTIMATE.start_SelectionSort_#t~mem5_6|)) |v_#memory_int_10|)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_6|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5, #memory_int] 6#L20true [152] L20-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_11))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_SelectionSort_~a.base_23)) (= v_ULTIMATE.start_SelectionSort_~i~0_17 (+ v_ULTIMATE.start_SelectionSort_~i~0_18 1)) (<= 0 .cse1) (= (store |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23 (store (select |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23) .cse1 v_ULTIMATE.start_SelectionSort_~temp~0_6)) |v_#memory_int_12|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_SelectionSort_~a.base_23))))) InVars {ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_18, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_4|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_17, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~i~0, #memory_int] 18#L8-2true [2020-06-22 08:45:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash 173411, now seen corresponding path program 1 times [2020-06-22 08:45:30,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:30,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:30,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:30,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash -842929377, now seen corresponding path program 1 times [2020-06-22 08:45:30,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:30,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:30,051 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 08:45:30,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:45:30,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:45:30,051 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:45:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:45:30,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:45:30,053 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-06-22 08:45:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:45:30,106 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-06-22 08:45:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:45:30,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 42 transitions. [2020-06-22 08:45:30,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 08:45:30,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 14 states and 18 transitions. [2020-06-22 08:45:30,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 08:45:30,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 08:45:30,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2020-06-22 08:45:30,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:45:30,112 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 08:45:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2020-06-22 08:45:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 08:45:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 08:45:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-06-22 08:45:30,114 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 08:45:30,115 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 08:45:30,115 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:45:30,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-06-22 08:45:30,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 08:45:30,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:45:30,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:45:30,116 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 08:45:30,116 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:30,116 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY [146] ULTIMATE.startENTRY-->L26: 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] 60#L26 [103] L26-->L26-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[] 61#L26-2 [121] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (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_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) 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_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 62#L8-2 [2020-06-22 08:45:30,117 INFO L796 eck$LassoCheckResult]: Loop: 62#L8-2 [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 63#L12-3 [99] L12-3-->L14: Formula: (< v_ULTIMATE.start_SelectionSort_~j~0_5 v_ULTIMATE.start_SelectionSort_~array_size_6) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} AuxVars[] AssignedVars[] 68#L14 [79] L14-->L14-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~j~0_6))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_SelectionSort_~a.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3 4) (select |v_#length_3| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= 0 .cse0)))) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem2] 73#L14-1 [75] L14-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_4))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_SelectionSort_~a.base_6) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5 4) (select |v_#length_5| v_ULTIMATE.start_SelectionSort_~a.base_6)) (<= 0 .cse0) (= (select |v_#valid_7| v_ULTIMATE.start_SelectionSort_~a.base_6) 1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_2|, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3] 72#L14-2 [115] L14-2-->L12-2: Formula: (>= |v_ULTIMATE.start_SelectionSort_#t~mem2_6| |v_ULTIMATE.start_SelectionSort_#t~mem3_6|) InVars {ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_6|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_6|} OutVars{ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_5|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_SelectionSort_#t~mem2] 69#L12-2 [72] L12-2-->L12-3: Formula: (= v_ULTIMATE.start_SelectionSort_~j~0_9 (+ v_ULTIMATE.start_SelectionSort_~j~0_10 1)) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_10} OutVars{ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_2|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0] 70#L12-3 [106] L12-3-->L12-4: Formula: (>= v_ULTIMATE.start_SelectionSort_~j~0_4 v_ULTIMATE.start_SelectionSort_~array_size_5) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} AuxVars[] AssignedVars[] 66#L12-4 [149] L12-4-->L19: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_14))) (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1))) (and (= v_ULTIMATE.start_SelectionSort_~temp~0_5 (select (select |v_#memory_int_9| v_ULTIMATE.start_SelectionSort_~a.base_21) .cse0)) (<= (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1 4) (select |v_#length_15| v_ULTIMATE.start_SelectionSort_~a.base_21)) (<= 0 .cse0) (= 1 (select |v_#valid_25| v_ULTIMATE.start_SelectionSort_~a.base_21))))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_5, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~mem4] 67#L19 [94] L19-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_SelectionSort_~a.base_12)) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_SelectionSort_~a.base_12)) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_SelectionSort_~a.base_12) .cse1) |v_ULTIMATE.start_SelectionSort_#t~mem5_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5] 64#L19-1 [151] L19-1-->L20: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_16))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_SelectionSort_~a.base_22)) (<= 0 .cse1) (= 1 (select |v_#valid_28| v_ULTIMATE.start_SelectionSort_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22) .cse1 |v_ULTIMATE.start_SelectionSort_#t~mem5_6|)) |v_#memory_int_10|)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_6|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5, #memory_int] 65#L20 [152] L20-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_11))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_SelectionSort_~a.base_23)) (= v_ULTIMATE.start_SelectionSort_~i~0_17 (+ v_ULTIMATE.start_SelectionSort_~i~0_18 1)) (<= 0 .cse1) (= (store |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23 (store (select |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23) .cse1 v_ULTIMATE.start_SelectionSort_~temp~0_6)) |v_#memory_int_12|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_SelectionSort_~a.base_23))))) InVars {ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_18, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_4|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_17, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~i~0, #memory_int] 62#L8-2 [2020-06-22 08:45:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash 173411, now seen corresponding path program 2 times [2020-06-22 08:45:30,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:30,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:30,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:30,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash -110670539, now seen corresponding path program 1 times [2020-06-22 08:45:30,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:30,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:30,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:45:30,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1245915501, now seen corresponding path program 1 times [2020-06-22 08:45:30,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:30,313 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-06-22 08:45:30,433 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:45:30,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:45:30,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:45:30,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:45:30,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:45:30,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:45:30,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:45:30,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:45:30,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 08:45:30,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:45:30,435 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:45:30,451 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 08:45:30,457 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 08:45:30,621 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 08:45:30,623 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 08:45:30,626 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 08:45:30,628 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 08:45:30,629 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 08:45:30,632 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 08:45:30,634 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 08:45:30,635 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 08:45:30,637 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 08:45:30,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:45:30,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:45:30,890 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 08:45:30,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:30,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:30,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:30,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:30,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:30,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:30,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:30,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:30,897 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 08:45:30,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:30,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:30,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:30,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:30,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:30,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:30,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:30,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:30,901 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 08:45:30,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:30,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:30,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:30,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:30,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:30,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:30,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:45:31,009 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 08:45:31,009 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2020-06-22 08:45:31,012 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:45:31,014 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:45:31,014 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:45:31,015 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1) = -1*ULTIMATE.start_SelectionSort_~a.offset - 4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 Supporting invariants [] [2020-06-22 08:45:31,033 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 08:45:31,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:31,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:45:31,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:31,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:31,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:45:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:31,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:31,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:31,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:31,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:31,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:31,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:31,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:31,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:31,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:45:31,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:31,488 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 08:45:31,492 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 4 loop predicates [2020-06-22 08:45:31,493 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-06-22 08:45:31,593 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 38 states and 47 transitions. Complement of second has 6 states. [2020-06-22 08:45:31,594 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 08:45:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 08:45:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-06-22 08:45:31,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 11 letters. [2020-06-22 08:45:31,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:31,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 11 letters. [2020-06-22 08:45:31,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:31,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 22 letters. [2020-06-22 08:45:31,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:31,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2020-06-22 08:45:31,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-06-22 08:45:31,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 43 transitions. [2020-06-22 08:45:31,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 08:45:31,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 08:45:31,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2020-06-22 08:45:31,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:45:31,606 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-06-22 08:45:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2020-06-22 08:45:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-06-22 08:45:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 08:45:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-06-22 08:45:31,608 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-06-22 08:45:31,609 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-06-22 08:45:31,609 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:45:31,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2020-06-22 08:45:31,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-06-22 08:45:31,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:45:31,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:45:31,610 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 08:45:31,610 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:45:31,611 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY [146] ULTIMATE.startENTRY-->L26: 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] 350#L26 [103] L26-->L26-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[] 351#L26-2 [120] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (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_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) 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_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 352#L8-2 [2020-06-22 08:45:31,611 INFO L796 eck$LassoCheckResult]: Loop: 352#L8-2 [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 353#L12-3 [99] L12-3-->L14: Formula: (< v_ULTIMATE.start_SelectionSort_~j~0_5 v_ULTIMATE.start_SelectionSort_~array_size_6) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} AuxVars[] AssignedVars[] 379#L14 [79] L14-->L14-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~j~0_6))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_SelectionSort_~a.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3 4) (select |v_#length_3| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= 0 .cse0)))) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem2] 373#L14-1 [75] L14-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_4))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_SelectionSort_~a.base_6) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5 4) (select |v_#length_5| v_ULTIMATE.start_SelectionSort_~a.base_6)) (<= 0 .cse0) (= (select |v_#valid_7| v_ULTIMATE.start_SelectionSort_~a.base_6) 1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_2|, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3] 374#L14-2 [115] L14-2-->L12-2: Formula: (>= |v_ULTIMATE.start_SelectionSort_#t~mem2_6| |v_ULTIMATE.start_SelectionSort_#t~mem3_6|) InVars {ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_6|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_6|} OutVars{ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_5|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_SelectionSort_#t~mem2] 380#L12-2 [72] L12-2-->L12-3: Formula: (= v_ULTIMATE.start_SelectionSort_~j~0_9 (+ v_ULTIMATE.start_SelectionSort_~j~0_10 1)) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_10} OutVars{ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_2|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0] 378#L12-3 [106] L12-3-->L12-4: Formula: (>= v_ULTIMATE.start_SelectionSort_~j~0_4 v_ULTIMATE.start_SelectionSort_~array_size_5) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} AuxVars[] AssignedVars[] 361#L12-4 [149] L12-4-->L19: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_14))) (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1))) (and (= v_ULTIMATE.start_SelectionSort_~temp~0_5 (select (select |v_#memory_int_9| v_ULTIMATE.start_SelectionSort_~a.base_21) .cse0)) (<= (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1 4) (select |v_#length_15| v_ULTIMATE.start_SelectionSort_~a.base_21)) (<= 0 .cse0) (= 1 (select |v_#valid_25| v_ULTIMATE.start_SelectionSort_~a.base_21))))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_5, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~mem4] 362#L19 [94] L19-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_SelectionSort_~a.base_12)) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_SelectionSort_~a.base_12)) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_SelectionSort_~a.base_12) .cse1) |v_ULTIMATE.start_SelectionSort_#t~mem5_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5] 357#L19-1 [151] L19-1-->L20: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_16))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_SelectionSort_~a.base_22)) (<= 0 .cse1) (= 1 (select |v_#valid_28| v_ULTIMATE.start_SelectionSort_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22) .cse1 |v_ULTIMATE.start_SelectionSort_#t~mem5_6|)) |v_#memory_int_10|)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_6|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5, #memory_int] 358#L20 [152] L20-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_11))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_SelectionSort_~a.base_23)) (= v_ULTIMATE.start_SelectionSort_~i~0_17 (+ v_ULTIMATE.start_SelectionSort_~i~0_18 1)) (<= 0 .cse1) (= (store |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23 (store (select |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23) .cse1 v_ULTIMATE.start_SelectionSort_~temp~0_6)) |v_#memory_int_12|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_SelectionSort_~a.base_23))))) InVars {ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_18, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_4|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_17, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~i~0, #memory_int] 352#L8-2 [2020-06-22 08:45:31,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:31,612 INFO L82 PathProgramCache]: Analyzing trace with hash 173410, now seen corresponding path program 1 times [2020-06-22 08:45:31,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:31,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:31,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:31,621 INFO L82 PathProgramCache]: Analyzing trace with hash -110670539, now seen corresponding path program 2 times [2020-06-22 08:45:31,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:31,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:31,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:31,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:31,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1374998220, now seen corresponding path program 1 times [2020-06-22 08:45:31,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:31,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:31,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:31,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:45:31,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:31,776 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-06-22 08:45:31,884 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:45:31,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:45:31,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:45:31,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:45:31,885 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:45:31,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:45:31,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:45:31,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:45:31,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 08:45:31,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:45:31,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:45:31,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 08:45:31,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 08:45:31,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 08:45:31,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 08:45:31,898 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 08:45:31,900 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 08:45:31,902 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 08:45:31,904 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 08:45:31,906 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 08:45:31,908 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 08:45:32,062 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 08:45:32,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:45:32,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:45:32,317 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 08:45:32,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:32,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:32,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,322 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 08:45:32,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,324 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 08:45:32,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:32,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:32,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,327 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 08:45:32,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,329 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 08:45:32,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,331 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 08:45:32,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,333 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 08:45:32,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,335 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 08:45:32,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,337 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 08:45:32,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,339 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 08:45:32,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:32,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:32,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,347 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 08:45:32,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,350 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 08:45:32,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:32,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:32,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,356 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 08:45:32,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:32,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:32,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:32,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,359 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 08:45:32,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:32,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:32,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:32,363 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 08:45:32,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:32,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:32,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:32,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:32,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:32,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:32,385 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:45:32,399 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:45:32,399 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 08:45:32,400 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:45:32,401 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:45:32,401 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:45:32,401 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~i~0) = 1*ULTIMATE.start_SelectionSort_~array_size - 1*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [] [2020-06-22 08:45:32,410 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 08:45:32,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:32,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:45:32,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:32,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:32,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:45:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:32,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:32,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:32,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:32,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:32,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:32,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:32,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:32,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:32,570 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:45:32,570 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 08:45:32,570 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 08:45:32,601 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 54 transitions. Complement of second has 4 states. [2020-06-22 08:45:32,602 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 08:45:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:45:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-06-22 08:45:32,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 11 letters. [2020-06-22 08:45:32,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:32,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 14 letters. Loop has 11 letters. [2020-06-22 08:45:32,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:32,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 22 letters. [2020-06-22 08:45:32,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:32,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2020-06-22 08:45:32,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 08:45:32,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 50 transitions. [2020-06-22 08:45:32,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 08:45:32,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 08:45:32,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2020-06-22 08:45:32,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:45:32,609 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2020-06-22 08:45:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2020-06-22 08:45:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 20. [2020-06-22 08:45:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:45:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-06-22 08:45:32,611 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 08:45:32,611 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-06-22 08:45:32,611 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:45:32,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-06-22 08:45:32,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 08:45:32,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:45:32,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:45:32,613 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 08:45:32,613 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 08:45:32,613 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY [146] ULTIMATE.startENTRY-->L26: 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] 624#L26 [103] L26-->L26-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[] 625#L26-2 [121] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (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_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) 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_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 626#L8-2 [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 628#L12-3 [2020-06-22 08:45:32,613 INFO L796 eck$LassoCheckResult]: Loop: 628#L12-3 [99] L12-3-->L14: Formula: (< v_ULTIMATE.start_SelectionSort_~j~0_5 v_ULTIMATE.start_SelectionSort_~array_size_6) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} AuxVars[] AssignedVars[] 634#L14 [79] L14-->L14-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~j~0_6))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_SelectionSort_~a.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3 4) (select |v_#length_3| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= 0 .cse0)))) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem2] 642#L14-1 [75] L14-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_4))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_SelectionSort_~a.base_6) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5 4) (select |v_#length_5| v_ULTIMATE.start_SelectionSort_~a.base_6)) (<= 0 .cse0) (= (select |v_#valid_7| v_ULTIMATE.start_SelectionSort_~a.base_6) 1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_2|, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3] 640#L14-2 [115] L14-2-->L12-2: Formula: (>= |v_ULTIMATE.start_SelectionSort_#t~mem2_6| |v_ULTIMATE.start_SelectionSort_#t~mem3_6|) InVars {ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_6|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_6|} OutVars{ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_5|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_SelectionSort_#t~mem2] 636#L12-2 [72] L12-2-->L12-3: Formula: (= v_ULTIMATE.start_SelectionSort_~j~0_9 (+ v_ULTIMATE.start_SelectionSort_~j~0_10 1)) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_10} OutVars{ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_2|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0] 628#L12-3 [2020-06-22 08:45:32,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:32,614 INFO L82 PathProgramCache]: Analyzing trace with hash 5375827, now seen corresponding path program 1 times [2020-06-22 08:45:32,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:32,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:32,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:32,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 122486931, now seen corresponding path program 1 times [2020-06-22 08:45:32,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:32,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:32,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash -401294207, now seen corresponding path program 1 times [2020-06-22 08:45:32,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:45:32,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:45:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:32,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:45:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:45:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:45:32,811 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-06-22 08:45:32,869 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:45:32,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:45:32,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:45:32,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:45:32,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:45:32,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:45:32,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:45:32,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:45:32,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 08:45:32,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:45:32,870 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:45:32,872 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 08:45:32,875 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 08:45:32,878 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 08:45:32,887 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 08:45:32,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 08:45:32,892 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 08:45:33,033 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 08:45:33,034 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 08:45:33,036 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 08:45:33,037 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 08:45:33,039 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 08:45:33,041 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 08:45:33,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:45:33,276 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:45:33,276 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 08:45:33,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:33,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:33,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:33,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,279 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 08:45:33,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:33,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:33,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,282 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 08:45:33,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:33,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:33,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:33,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,284 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 08:45:33,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:33,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:33,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:33,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,286 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 08:45:33,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:33,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:33,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:33,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,288 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 08:45:33,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:45:33,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:45:33,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:45:33,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,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 08:45:33,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:33,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:33,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,299 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 08:45:33,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:33,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:33,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,302 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 08:45:33,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:33,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:33,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:45:33,330 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 08:45:33,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:45:33,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:45:33,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:45:33,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:45:33,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:45:33,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:45:33,347 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:45:33,361 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 08:45:33,361 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 08:45:33,362 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:45:33,363 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:45:33,363 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:45:33,363 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -4*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [] [2020-06-22 08:45:33,384 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 08:45:33,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:45:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:33,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:45:33,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:33,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:33,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:33,434 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 08:45:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:33,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:33,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:45:33,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:45:33,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:45:33,531 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:45:33,532 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 08:45:33,532 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-06-22 08:45:33,585 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 34 states and 45 transitions. Complement of second has 6 states. [2020-06-22 08:45:33,585 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 08:45:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 08:45:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2020-06-22 08:45:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 4 letters. Loop has 5 letters. [2020-06-22 08:45:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:33,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 9 letters. Loop has 5 letters. [2020-06-22 08:45:33,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:33,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 4 letters. Loop has 10 letters. [2020-06-22 08:45:33,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:45:33,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2020-06-22 08:45:33,590 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:45:33,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2020-06-22 08:45:33,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:45:33,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:45:33,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:45:33,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:45:33,591 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:45:33,591 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:45:33,591 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:45:33,591 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:45:33,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:45:33,592 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:45:33,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:45:33,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:45:33 BasicIcfg [2020-06-22 08:45:33,598 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:45:33,599 INFO L168 Benchmark]: Toolchain (without parser) took 8039.93 ms. Allocated memory was 514.9 MB in the beginning and 675.8 MB in the end (delta: 161.0 MB). Free memory was 436.7 MB in the beginning and 586.3 MB in the end (delta: -149.6 MB). Peak memory consumption was 11.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:45:33,600 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:45:33,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.98 ms. Allocated memory was 514.9 MB in the beginning and 572.0 MB in the end (delta: 57.1 MB). Free memory was 436.2 MB in the beginning and 541.8 MB in the end (delta: -105.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:45:33,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.73 ms. Allocated memory is still 572.0 MB. Free memory was 541.8 MB in the beginning and 539.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:45:33,601 INFO L168 Benchmark]: Boogie Preprocessor took 26.80 ms. Allocated memory is still 572.0 MB. Free memory was 539.5 MB in the beginning and 537.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:45:33,602 INFO L168 Benchmark]: RCFGBuilder took 339.22 ms. Allocated memory is still 572.0 MB. Free memory was 537.9 MB in the beginning and 518.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. [2020-06-22 08:45:33,602 INFO L168 Benchmark]: BlockEncodingV2 took 122.59 ms. Allocated memory is still 572.0 MB. Free memory was 518.9 MB in the beginning and 509.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:45:33,603 INFO L168 Benchmark]: TraceAbstraction took 3552.78 ms. Allocated memory was 572.0 MB in the beginning and 604.5 MB in the end (delta: 32.5 MB). Free memory was 509.6 MB in the beginning and 438.7 MB in the end (delta: 71.0 MB). Peak memory consumption was 103.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:45:33,603 INFO L168 Benchmark]: BuchiAutomizer took 3638.05 ms. Allocated memory was 604.5 MB in the beginning and 675.8 MB in the end (delta: 71.3 MB). Free memory was 438.7 MB in the beginning and 586.3 MB in the end (delta: -147.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:45:33,608 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 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 310.98 ms. Allocated memory was 514.9 MB in the beginning and 572.0 MB in the end (delta: 57.1 MB). Free memory was 436.2 MB in the beginning and 541.8 MB in the end (delta: -105.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.73 ms. Allocated memory is still 572.0 MB. Free memory was 541.8 MB in the beginning and 539.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.80 ms. Allocated memory is still 572.0 MB. Free memory was 539.5 MB in the beginning and 537.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * RCFGBuilder took 339.22 ms. Allocated memory is still 572.0 MB. Free memory was 537.9 MB in the beginning and 518.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 122.59 ms. Allocated memory is still 572.0 MB. Free memory was 518.9 MB in the beginning and 509.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3552.78 ms. Allocated memory was 572.0 MB in the beginning and 604.5 MB in the end (delta: 32.5 MB). Free memory was 509.6 MB in the beginning and 438.7 MB in the end (delta: 71.0 MB). Peak memory consumption was 103.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3638.05 ms. Allocated memory was 604.5 MB in the beginning and 675.8 MB in the end (delta: 71.3 MB). Free memory was 438.7 MB in the beginning and 586.3 MB in the end (delta: -147.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] * 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 - 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 - 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 - 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 - 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: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 19]: 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: 19]: 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: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: 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: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 8]: Loop Invariant [2020-06-22 08:45:33,617 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,617 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,617 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,617 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 * i + a + 4 <= unknown-#length-unknown[a] && a + 4 * min + 4 <= unknown-#length-unknown[a]) && (\exists ULTIMATE.start_main_~array_size~0 : int :: unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0 && array_size <= ULTIMATE.start_main_~array_size~0)) && (((((min + 1 <= j && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a]) && 0 <= a + 4 * min) && a == 0) && 1 <= array_size) && \valid[a] == 1) || (((array_size <= i + 1 && a + 4 * min + 4 <= unknown-#length-unknown[a]) && j <= i + 1) && (((((min + 1 <= j && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a]) && 0 <= a + 4 * min) && a == 0) && 1 <= array_size) && \valid[a] == 1)) || (((((0 == i && 4 <= unknown-#length-unknown[a]) && a == 0) && 1 <= array_size) && (\exists ULTIMATE.start_main_~array_size~0 : int :: unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0 && array_size <= ULTIMATE.start_main_~array_size~0)) && \valid[a] == 1) - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 08:45:33,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2020-06-22 08:45:33,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:45:33,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\exists ULTIMATE.start_main_~array_size~0 : int :: i + 2 <= ULTIMATE.start_main_~array_size~0 && unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0) && (((((((min + 1 <= j && 0 <= i) && 0 <= a + 4 * min) && a == 0) && 1 <= array_size) && a + 4 * min + 8 <= unknown-#length-unknown[a]) && \valid[a] == 1) || ((((((min + 1 <= j && a + 4 * min + 4 <= unknown-#length-unknown[a]) && 0 <= i) && 1 <= min) && a == 0) && 1 <= array_size) && \valid[a] == 1))) && i + 1 <= j) && (\exists ULTIMATE.start_main_~array_size~0 : int :: unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0 && array_size <= ULTIMATE.start_main_~array_size~0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 12 error locations. SAFE Result, 3.4s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 415 SDslu, 178 SDs, 0 SdLazy, 650 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, 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, 11 MinimizatonAttempts, 87 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 12 NumberOfFragments, 258 HoareAnnotationTreeSize, 2 FomulaSimplifications, 2031 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 744 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 201 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 186 ConstructedInterpolants, 24 QuantifiedInterpolants, 22904 SizeOfPredicates, 21 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 47/88 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 -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 4 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -4 * j + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 50 SDtfs, 125 SDslu, 39 SDs, 0 SdLazy, 179 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax100 hnf100 lsp96 ukn74 mio100 lsp67 div100 bol100 ite100 ukn100 eq176 hnf89 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 113ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:45:22.359 ----------------------------------------------- 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 08:45:33.853 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check