./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8104a25549f6efe413528ca8cc098e1acad610e4 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:35:54,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:35:54,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:35:54,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:35:54,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:35:54,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:35:54,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:35:54,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:35:54,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:35:54,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:35:54,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:35:54,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:35:54,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:35:54,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:35:54,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:35:54,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:35:54,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:35:54,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:35:54,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:35:54,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:35:54,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:35:54,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:35:54,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:35:54,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:35:54,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:35:54,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:35:54,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:35:54,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:35:54,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:35:54,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:35:54,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:35:54,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:35:54,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:35:54,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:35:54,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:35:54,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:35:54,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:35:54,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:35:54,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:35:54,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:35:54,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:35:54,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:35:54,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:35:54,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:35:54,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:35:54,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:35:54,574 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:35:54,575 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:35:54,575 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:35:54,575 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:35:54,575 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:35:54,575 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:35:54,576 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:35:54,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:35:54,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:35:54,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:35:54,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:35:54,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:35:54,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:35:54,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:35:54,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:35:54,578 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:35:54,578 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:35:54,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:35:54,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:35:54,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:35:54,579 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:35:54,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:35:54,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:35:54,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:35:54,580 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:35:54,582 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:35:54,582 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2020-07-29 01:35:54,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:35:54,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:35:54,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:35:54,965 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:35:54,965 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:35:54,966 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2020-07-29 01:35:55,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c927c0eb/ede217178da642699dedb67f720f51e6/FLAG7059cf4f4 [2020-07-29 01:35:55,617 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:35:55,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2020-07-29 01:35:55,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c927c0eb/ede217178da642699dedb67f720f51e6/FLAG7059cf4f4 [2020-07-29 01:35:55,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c927c0eb/ede217178da642699dedb67f720f51e6 [2020-07-29 01:35:55,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:35:55,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:35:55,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:55,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:35:55,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:35:55,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:55" (1/1) ... [2020-07-29 01:35:55,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170972dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:55, skipping insertion in model container [2020-07-29 01:35:55,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:55" (1/1) ... [2020-07-29 01:35:55,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:35:55,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:35:56,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:56,347 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:35:56,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:56,486 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:35:56,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56 WrapperNode [2020-07-29 01:35:56,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:56,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:56,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:35:56,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:35:56,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:56,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:35:56,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:35:56,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:35:56,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:35:56,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:35:56,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:35:56,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:35:56,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:35:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:35:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:35:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:35:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:35:56,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:35:56,980 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:35:56,981 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:35:56,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:56 BoogieIcfgContainer [2020-07-29 01:35:56,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:35:56,987 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:35:56,988 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:35:56,994 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:35:56,996 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:56,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:35:55" (1/3) ... [2020-07-29 01:35:56,998 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30fe368c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:56, skipping insertion in model container [2020-07-29 01:35:56,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:56,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (2/3) ... [2020-07-29 01:35:56,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30fe368c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:56, skipping insertion in model container [2020-07-29 01:35:57,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:57,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:56" (3/3) ... [2020-07-29 01:35:57,003 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2020-07-29 01:35:57,066 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:35:57,066 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:35:57,067 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:35:57,067 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:35:57,067 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:35:57,068 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:35:57,068 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:35:57,068 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:35:57,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:35:57,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:57,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:57,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:57,133 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:57,134 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:57,134 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:35:57,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:35:57,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:57,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:57,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:57,146 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:57,146 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:57,153 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 6#L550-3true [2020-07-29 01:35:57,154 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2020-07-29 01:35:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 01:35:57,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025160024] [2020-07-29 01:35:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2020-07-29 01:35:57,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295532011] [2020-07-29 01:35:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:57,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#true} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {21#true} is VALID [2020-07-29 01:35:57,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume !true; {22#false} is VALID [2020-07-29 01:35:57,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#false} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {22#false} is VALID [2020-07-29 01:35:57,397 INFO L280 TraceCheckUtils]: 3: Hoare triple {22#false} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {22#false} is VALID [2020-07-29 01:35:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:57,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295532011] [2020-07-29 01:35:57,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:57,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:35:57,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081153789] [2020-07-29 01:35:57,418 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:57,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:35:57,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:35:57,439 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2020-07-29 01:35:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:57,522 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:35:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:35:57,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:35:57,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:57,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-07-29 01:35:57,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:57,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2020-07-29 01:35:57,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:35:57,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:57,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:35:57,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:57,570 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:35:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:35:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:35:57,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:57,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:35:57,593 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:35:57,594 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:35:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:57,596 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:35:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:35:57,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:57,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:57,597 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:35:57,598 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:35:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:57,599 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:35:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:35:57,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:57,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:57,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:57,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:35:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 01:35:57,603 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:35:57,603 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:35:57,603 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:57,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:35:57,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:35:57,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:57,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:57,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:57,607 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:57,607 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 41#L550-3 [2020-07-29 01:35:57,607 INFO L796 eck$LassoCheckResult]: Loop: 41#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2020-07-29 01:35:57,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,608 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-07-29 01:35:57,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343607039] [2020-07-29 01:35:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,659 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:57,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2020-07-29 01:35:57,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275080661] [2020-07-29 01:35:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2020-07-29 01:35:57,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091180759] [2020-07-29 01:35:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:58,019 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-07-29 01:35:58,290 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-07-29 01:35:58,392 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:58,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:58,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:58,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:58,394 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:58,395 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:58,395 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:58,395 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:58,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2020-07-29 01:35:58,396 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:58,396 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:58,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,700 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-07-29 01:35:58,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:58,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,493 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:59,500 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,510 INFO L120 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-07-29 01:35:59,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:59,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:59,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:59,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:59,576 INFO L120 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-07-29 01:35:59,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:59,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:59,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,613 INFO L120 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-07-29 01:35:59,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:59,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:59,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:59,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,645 INFO L120 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-07-29 01:35:59,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:59,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:59,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:59,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,683 INFO L120 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-07-29 01:35:59,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:59,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:59,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,717 INFO L120 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-07-29 01:35:59,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:59,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:59,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:59,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,751 INFO L120 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-07-29 01:35:59,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:59,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:59,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,788 INFO L120 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-07-29 01:35:59,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:59,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:59,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,828 INFO L120 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-07-29 01:35:59,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:59,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:59,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:59,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,857 INFO L120 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-07-29 01:35:59,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:59,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:59,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,896 INFO L120 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-07-29 01:35:59,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:59,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:59,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,945 INFO L120 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-07-29 01:35:59,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:59,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:59,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:59,987 INFO L120 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-07-29 01:35:59,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:59,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:59,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:59,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:59,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:59,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:59,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,026 INFO L120 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-07-29 01:36:00,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:00,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:00,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:00,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:00,068 INFO L120 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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:00,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:00,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:00,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,096 INFO L120 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-07-29 01:36:00,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:00,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:00,135 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:36:00,163 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:36:00,163 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:00,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,181 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:36:00,182 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:36:00,182 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2020-07-29 01:36:00,364 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:36:00,369 INFO L393 LassoCheck]: Loop: "assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0;" "insertionSort_#t~short6 := insertionSort_~j~0 > 0;" "assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0;" "assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;" "call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);" "insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2;" [2020-07-29 01:36:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:00,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:36:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:00,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:00,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {80#unseeded} is VALID [2020-07-29 01:36:00,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {80#unseeded} is VALID [2020-07-29 01:36:00,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#unseeded} assume !(main_~array_size~0 < 1); {80#unseeded} is VALID [2020-07-29 01:36:00,441 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {80#unseeded} is VALID [2020-07-29 01:36:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:00,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:36:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:00,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:00,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {83#(>= oldRank0 (+ ULTIMATE.start_insertionSort_~array_size (* (- 1) ULTIMATE.start_insertionSort_~i~0)))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:36:00,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:36:00,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:36:00,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:36:00,496 INFO L280 TraceCheckUtils]: 4: Hoare triple {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 01:36:00,497 INFO L280 TraceCheckUtils]: 5: Hoare triple {127#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {113#(or (and (> oldRank0 (+ ULTIMATE.start_insertionSort_~array_size (* (- 1) ULTIMATE.start_insertionSort_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:36:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:00,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:36:00,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:00,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,519 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:36:00,520 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:36:00,592 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2020-07-29 01:36:00,592 INFO L141 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-07-29 01:36:00,592 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:00,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:36:00,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:00,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:00,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:36:00,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:36:00,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:00,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:00,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:36:00,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:00,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:00,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:00,603 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 4 [2020-07-29 01:36:00,605 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:36:00,605 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:36:00,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:36:00,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:36:00,608 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:36:00,609 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:00,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:36:00,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:36:00,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:36:00,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:36:00,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:36:00,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:36:00,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:36:00,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:36:00,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:36:00,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:00,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:00,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:00,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:36:00,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:36:00,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:36:00,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:00,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:00,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:00,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:00,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:00,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:00,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:36:00,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:36:00,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:36:00,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:00,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:00,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:00,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:36:00,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:36:00,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:36:00,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:00,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:00,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:00,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:00,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:00,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:00,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:00,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:00,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:00,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,636 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:36:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-07-29 01:36:00,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:36:00,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:36:00,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:36:00,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:00,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:36:00,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:00,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2020-07-29 01:36:00,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:36:00,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:36:00,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-07-29 01:36:00,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:36:00,645 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:36:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-07-29 01:36:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 01:36:00,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:36:00,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand 16 states. [2020-07-29 01:36:00,648 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand 16 states. [2020-07-29 01:36:00,648 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 16 states. [2020-07-29 01:36:00,649 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:00,652 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:36:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:36:00,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:00,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:00,654 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 23 transitions. [2020-07-29 01:36:00,654 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 23 transitions. [2020-07-29 01:36:00,654 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:00,657 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-29 01:36:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:36:00,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:00,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:00,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:36:00,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:36:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:36:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:36:00,659 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:36:00,660 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:36:00,660 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:36:00,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:36:00,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:00,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:00,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:00,662 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:36:00,662 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:36:00,662 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 174#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 175#L560 assume !(main_~array_size~0 < 1); 176#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 177#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 169#L553-6 [2020-07-29 01:36:00,662 INFO L796 eck$LassoCheckResult]: Loop: 169#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 178#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 181#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 168#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 169#L553-6 [2020-07-29 01:36:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-07-29 01:36:00,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:00,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878924284] [2020-07-29 01:36:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:00,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:00,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:00,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:00,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2020-07-29 01:36:00,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:00,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229274178] [2020-07-29 01:36:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:00,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:00,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:00,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2020-07-29 01:36:00,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:00,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067895249] [2020-07-29 01:36:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:00,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:00,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:00,765 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:01,072 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-07-29 01:36:01,162 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:36:01,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:36:01,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:36:01,162 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:36:01,163 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:36:01,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:01,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:36:01,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:36:01,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2020-07-29 01:36:01,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:36:01,163 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:36:01,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,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-07-29 01:36:01,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:01,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:02,075 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:36:02,076 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:02,081 INFO L120 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-07-29 01:36:02,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:02,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:02,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:02,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:02,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:02,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:02,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:02,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:02,108 INFO L120 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-07-29 01:36:02,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:02,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:02,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:02,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:02,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:02,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:02,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:02,159 INFO L120 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-07-29 01:36:02,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:02,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:02,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:02,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:02,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:02,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:02,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:36:02,226 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:36:02,226 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:02,262 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:36:02,288 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:36:02,289 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:36:02,289 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2020-07-29 01:36:02,342 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:36:02,346 INFO L393 LassoCheck]: Loop: "insertionSort_#t~short6 := insertionSort_~j~0 > 0;" "assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0;" "assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7;" "insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4;" [2020-07-29 01:36:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:02,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:36:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:02,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:02,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {267#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {267#unseeded} is VALID [2020-07-29 01:36:02,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {267#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {267#unseeded} is VALID [2020-07-29 01:36:02,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {267#unseeded} assume !(main_~array_size~0 < 1); {267#unseeded} is VALID [2020-07-29 01:36:02,387 INFO L280 TraceCheckUtils]: 3: Hoare triple {267#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {267#unseeded} is VALID [2020-07-29 01:36:02,387 INFO L280 TraceCheckUtils]: 4: Hoare triple {267#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {267#unseeded} is VALID [2020-07-29 01:36:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:02,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:36:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:02,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:02,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {270#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {317#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= ULTIMATE.start_insertionSort_~j~0 oldRank0))} is VALID [2020-07-29 01:36:02,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {317#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= ULTIMATE.start_insertionSort_~j~0 oldRank0))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {321#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} is VALID [2020-07-29 01:36:02,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {321#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; {321#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} is VALID [2020-07-29 01:36:02,452 INFO L280 TraceCheckUtils]: 3: Hoare triple {321#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; {300#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_insertionSort_~j~0)) unseeded)} is VALID [2020-07-29 01:36:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:02,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:36:02,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:02,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:36:02,464 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 01:36:02,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2020-07-29 01:36:02,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:36:02,585 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:02,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 01:36:02,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:02,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:02,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:36:02,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:36:02,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:02,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:02,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2020-07-29 01:36:02,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:02,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:02,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:02,590 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 01:36:02,591 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:02,591 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:36:02,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:36:02,592 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:36:02,593 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 62 transitions. cyclomatic complexity: 19 [2020-07-29 01:36:02,594 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:02,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:02,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:02,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:02,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:36:02,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:36:02,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:36:02,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:36:02,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:36:02,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:36:02,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:36:02,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:36:02,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:36:02,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:02,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:02,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:02,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:02,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:02,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:02,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:02,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:02,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:02,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:02,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:02,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:02,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:02,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:02,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:02,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:36:02,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:36:02,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:36:02,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:36:02,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:36:02,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:36:02,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:02,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:02,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:02,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:02,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:02,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:02,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,608 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:36:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-29 01:36:02,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:02,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:02,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:36:02,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:02,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. cyclomatic complexity: 19 [2020-07-29 01:36:02,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:02,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2020-07-29 01:36:02,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:36:02,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:36:02,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:36:02,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:36:02,617 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:36:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:36:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2020-07-29 01:36:02,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:36:02,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 22 states. [2020-07-29 01:36:02,621 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 22 states. [2020-07-29 01:36:02,621 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 22 states. [2020-07-29 01:36:02,622 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:02,624 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:36:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:36:02,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:02,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:02,625 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 30 states and 40 transitions. [2020-07-29 01:36:02,625 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 30 states and 40 transitions. [2020-07-29 01:36:02,626 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:02,628 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:36:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:36:02,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:02,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:02,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:36:02,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:36:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:36:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-07-29 01:36:02,631 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-29 01:36:02,631 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-29 01:36:02,631 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:36:02,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2020-07-29 01:36:02,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:02,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:02,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:02,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:36:02,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:36:02,633 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 394#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 395#L560 assume !(main_~array_size~0 < 1); 396#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 397#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 391#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 403#L553-1 assume !insertionSort_#t~short6; 404#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 405#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 392#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 393#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 389#L553-6 [2020-07-29 01:36:02,633 INFO L796 eck$LassoCheckResult]: Loop: 389#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 400#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 402#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 388#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 389#L553-6 [2020-07-29 01:36:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2020-07-29 01:36:02,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:02,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159523250] [2020-07-29 01:36:02,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:02,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {528#true} is VALID [2020-07-29 01:36:02,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {528#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {528#true} is VALID [2020-07-29 01:36:02,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {528#true} assume !(main_~array_size~0 < 1); {528#true} is VALID [2020-07-29 01:36:02,724 INFO L280 TraceCheckUtils]: 3: Hoare triple {528#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {530#(<= 1 ULTIMATE.start_insertionSort_~i~0)} is VALID [2020-07-29 01:36:02,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#(<= 1 ULTIMATE.start_insertionSort_~i~0)} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {531#(<= 1 ULTIMATE.start_insertionSort_~j~0)} is VALID [2020-07-29 01:36:02,726 INFO L280 TraceCheckUtils]: 5: Hoare triple {531#(<= 1 ULTIMATE.start_insertionSort_~j~0)} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {532#|ULTIMATE.start_insertionSort_#t~short6|} is VALID [2020-07-29 01:36:02,727 INFO L280 TraceCheckUtils]: 6: Hoare triple {532#|ULTIMATE.start_insertionSort_#t~short6|} assume !insertionSort_#t~short6; {529#false} is VALID [2020-07-29 01:36:02,727 INFO L280 TraceCheckUtils]: 7: Hoare triple {529#false} assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; {529#false} is VALID [2020-07-29 01:36:02,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {529#false} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {529#false} is VALID [2020-07-29 01:36:02,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {529#false} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {529#false} is VALID [2020-07-29 01:36:02,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {529#false} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {529#false} is VALID [2020-07-29 01:36:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:02,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159523250] [2020-07-29 01:36:02,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:36:02,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:36:02,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55348350] [2020-07-29 01:36:02,730 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:36:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2020-07-29 01:36:02,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:02,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959004532] [2020-07-29 01:36:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:02,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:02,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:02,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:02,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:36:02,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:36:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:36:02,880 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 01:36:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:36:03,035 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-29 01:36:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:36:03,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:36:03,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:03,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2020-07-29 01:36:03,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:03,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 50 transitions. [2020-07-29 01:36:03,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:36:03,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:36:03,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-07-29 01:36:03,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:36:03,061 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-07-29 01:36:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-07-29 01:36:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2020-07-29 01:36:03,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:36:03,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 50 transitions. Second operand 29 states. [2020-07-29 01:36:03,065 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 50 transitions. Second operand 29 states. [2020-07-29 01:36:03,065 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 29 states. [2020-07-29 01:36:03,066 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:03,068 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-29 01:36:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2020-07-29 01:36:03,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:03,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:03,069 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 39 states and 50 transitions. [2020-07-29 01:36:03,070 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 39 states and 50 transitions. [2020-07-29 01:36:03,070 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:03,073 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-29 01:36:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2020-07-29 01:36:03,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:03,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:03,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:36:03,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:36:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:36:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-07-29 01:36:03,077 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-29 01:36:03,077 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-29 01:36:03,077 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:36:03,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2020-07-29 01:36:03,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:03,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:03,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:03,079 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:36:03,079 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:36:03,079 INFO L794 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 582#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 583#L560 assume !(main_~array_size~0 < 1); 586#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 587#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 589#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 596#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 597#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 598#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 584#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 585#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 590#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 594#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 595#L553-3 [2020-07-29 01:36:03,079 INFO L796 eck$LassoCheckResult]: Loop: 595#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 578#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 579#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 592#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 595#L553-3 [2020-07-29 01:36:03,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:03,080 INFO L82 PathProgramCache]: Analyzing trace with hash 587980355, now seen corresponding path program 2 times [2020-07-29 01:36:03,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:03,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140330231] [2020-07-29 01:36:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:03,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:03,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:03,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1910182, now seen corresponding path program 3 times [2020-07-29 01:36:03,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:03,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692582568] [2020-07-29 01:36:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:03,145 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:03,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:03,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:03,168 INFO L82 PathProgramCache]: Analyzing trace with hash -508816664, now seen corresponding path program 1 times [2020-07-29 01:36:03,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:03,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138220523] [2020-07-29 01:36:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:03,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:03,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:03,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:03,359 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2020-07-29 01:36:03,858 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 99 [2020-07-29 01:36:03,989 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:36:03,989 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:36:03,989 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:36:03,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:36:03,990 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:36:03,990 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:03,990 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:36:03,990 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:36:03,990 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2020-07-29 01:36:03,990 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:36:03,991 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:36:04,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:04,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:04,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-07-29 01:36:04,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:04,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:04,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:04,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:04,738 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-07-29 01:36:05,061 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-07-29 01:36:05,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:05,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:05,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:05,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:05,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:06,010 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2020-07-29 01:36:06,165 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-07-29 01:36:06,259 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:36:06,260 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,269 INFO L120 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-07-29 01:36:06,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:06,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:06,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:06,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:06,297 INFO L120 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 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:06,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:06,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:06,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:06,343 INFO L120 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-07-29 01:36:06,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:06,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,380 INFO L120 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-07-29 01:36:06,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:06,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:06,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,411 INFO L120 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-07-29 01:36:06,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:06,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:06,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:06,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,440 INFO L120 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-07-29 01:36:06,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:06,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:06,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,471 INFO L120 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-07-29 01:36:06,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:06,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:06,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:06,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,500 INFO L120 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-07-29 01:36:06,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:06,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:06,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:06,552 INFO L120 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-07-29 01:36:06,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:06,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:06,615 INFO L120 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-07-29 01:36:06,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:06,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:06,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:06,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:06,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:06,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:36:06,665 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:36:06,666 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:06,669 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:06,673 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:36:06,673 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:36:06,673 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2020-07-29 01:36:06,736 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2020-07-29 01:36:06,739 INFO L393 LassoCheck]: Loop: "assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7;" "insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4;" "insertionSort_#t~short6 := insertionSort_~j~0 > 0;" "assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0;" [2020-07-29 01:36:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:06,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:36:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:06,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:06,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {757#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {757#unseeded} is VALID [2020-07-29 01:36:06,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {757#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {757#unseeded} is VALID [2020-07-29 01:36:06,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {757#unseeded} assume !(main_~array_size~0 < 1); {757#unseeded} is VALID [2020-07-29 01:36:06,801 INFO L280 TraceCheckUtils]: 3: Hoare triple {757#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {757#unseeded} is VALID [2020-07-29 01:36:06,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {757#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {757#unseeded} is VALID [2020-07-29 01:36:06,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {757#unseeded} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {757#unseeded} is VALID [2020-07-29 01:36:06,806 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#unseeded} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {757#unseeded} is VALID [2020-07-29 01:36:06,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#unseeded} assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; {757#unseeded} is VALID [2020-07-29 01:36:06,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {757#unseeded} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {757#unseeded} is VALID [2020-07-29 01:36:06,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {757#unseeded} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {757#unseeded} is VALID [2020-07-29 01:36:06,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {757#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {757#unseeded} is VALID [2020-07-29 01:36:06,812 INFO L280 TraceCheckUtils]: 11: Hoare triple {757#unseeded} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {757#unseeded} is VALID [2020-07-29 01:36:06,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {757#unseeded} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {757#unseeded} is VALID [2020-07-29 01:36:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:06,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:36:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:06,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:06,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} is VALID [2020-07-29 01:36:06,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; {864#(<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0)} is VALID [2020-07-29 01:36:06,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {864#(<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0)} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {868#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0))} is VALID [2020-07-29 01:36:06,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {868#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {820#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_insertionSort_~j~0)) unseeded)} is VALID [2020-07-29 01:36:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:06,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:36:06,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:06,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:06,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:36:06,914 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 01:36:07,060 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 9 states. [2020-07-29 01:36:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:36:07,060 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:07,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:36:07,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:36:07,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2020-07-29 01:36:07,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,064 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:36:07,065 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:07,065 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:36:07,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,066 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:36:07,067 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 62 transitions. cyclomatic complexity: 15 [2020-07-29 01:36:07,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:07,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:36:07,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:36:07,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:36:07,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 62 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,079 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:36:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 01:36:07,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,081 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:36:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:36:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:07,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {757#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {757#unseeded} is VALID [2020-07-29 01:36:07,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {757#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {757#unseeded} is VALID [2020-07-29 01:36:07,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {757#unseeded} assume !(main_~array_size~0 < 1); {757#unseeded} is VALID [2020-07-29 01:36:07,130 INFO L280 TraceCheckUtils]: 3: Hoare triple {757#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {757#unseeded} is VALID [2020-07-29 01:36:07,131 INFO L280 TraceCheckUtils]: 4: Hoare triple {757#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {757#unseeded} is VALID [2020-07-29 01:36:07,131 INFO L280 TraceCheckUtils]: 5: Hoare triple {757#unseeded} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {757#unseeded} is VALID [2020-07-29 01:36:07,132 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#unseeded} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {757#unseeded} is VALID [2020-07-29 01:36:07,133 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#unseeded} assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; {757#unseeded} is VALID [2020-07-29 01:36:07,133 INFO L280 TraceCheckUtils]: 8: Hoare triple {757#unseeded} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {757#unseeded} is VALID [2020-07-29 01:36:07,134 INFO L280 TraceCheckUtils]: 9: Hoare triple {757#unseeded} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {757#unseeded} is VALID [2020-07-29 01:36:07,136 INFO L280 TraceCheckUtils]: 10: Hoare triple {757#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {757#unseeded} is VALID [2020-07-29 01:36:07,137 INFO L280 TraceCheckUtils]: 11: Hoare triple {757#unseeded} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {757#unseeded} is VALID [2020-07-29 01:36:07,138 INFO L280 TraceCheckUtils]: 12: Hoare triple {757#unseeded} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {757#unseeded} is VALID [2020-07-29 01:36:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:36:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:07,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} is VALID [2020-07-29 01:36:07,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; {978#(<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0)} is VALID [2020-07-29 01:36:07,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {978#(<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0)} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {982#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0))} is VALID [2020-07-29 01:36:07,220 INFO L280 TraceCheckUtils]: 3: Hoare triple {982#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {820#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_insertionSort_~j~0)) unseeded)} is VALID [2020-07-29 01:36:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:07,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:36:07,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:07,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,235 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:36:07,235 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 01:36:07,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 51 states and 63 transitions. Complement of second has 9 states. [2020-07-29 01:36:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:36:07,362 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:07,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:36:07,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:36:07,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2020-07-29 01:36:07,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,367 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:36:07,367 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:07,367 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:36:07,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,369 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:36:07,369 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 63 transitions. cyclomatic complexity: 16 [2020-07-29 01:36:07,370 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:07,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:36:07,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:36:07,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:36:07,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:36:07,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:36:07,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:36:07,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:36:07,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:36:07,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:36:07,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 63 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,389 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:36:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 01:36:07,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,390 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:36:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:36:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:07,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {757#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {757#unseeded} is VALID [2020-07-29 01:36:07,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {757#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {757#unseeded} is VALID [2020-07-29 01:36:07,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {757#unseeded} assume !(main_~array_size~0 < 1); {757#unseeded} is VALID [2020-07-29 01:36:07,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {757#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {757#unseeded} is VALID [2020-07-29 01:36:07,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {757#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {757#unseeded} is VALID [2020-07-29 01:36:07,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {757#unseeded} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {757#unseeded} is VALID [2020-07-29 01:36:07,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#unseeded} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {757#unseeded} is VALID [2020-07-29 01:36:07,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#unseeded} assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; {757#unseeded} is VALID [2020-07-29 01:36:07,438 INFO L280 TraceCheckUtils]: 8: Hoare triple {757#unseeded} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {757#unseeded} is VALID [2020-07-29 01:36:07,438 INFO L280 TraceCheckUtils]: 9: Hoare triple {757#unseeded} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {757#unseeded} is VALID [2020-07-29 01:36:07,439 INFO L280 TraceCheckUtils]: 10: Hoare triple {757#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {757#unseeded} is VALID [2020-07-29 01:36:07,440 INFO L280 TraceCheckUtils]: 11: Hoare triple {757#unseeded} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {757#unseeded} is VALID [2020-07-29 01:36:07,440 INFO L280 TraceCheckUtils]: 12: Hoare triple {757#unseeded} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {757#unseeded} is VALID [2020-07-29 01:36:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:36:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:07,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:07,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} is VALID [2020-07-29 01:36:07,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; {1093#(<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0)} is VALID [2020-07-29 01:36:07,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {1093#(<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0)} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {1097#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0))} is VALID [2020-07-29 01:36:07,522 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= (+ ULTIMATE.start_insertionSort_~j~0 1) oldRank0))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {820#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_insertionSort_~j~0)) unseeded)} is VALID [2020-07-29 01:36:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:07,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:36:07,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,537 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-07-29 01:36:07,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 01:36:07,682 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 61 states and 78 transitions. Complement of second has 8 states. [2020-07-29 01:36:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:36:07,682 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:07,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:36:07,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:36:07,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:07,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:07,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. [2020-07-29 01:36:07,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:07,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:36:07,686 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:36:07,686 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:07,686 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:36:07,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:07,687 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:36:07,688 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 61 states and 78 transitions. cyclomatic complexity: 20 [2020-07-29 01:36:07,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. cyclomatic complexity: 20 [2020-07-29 01:36:07,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:36:07,688 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:36:07,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:36:07,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:36:07,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:36:07,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:36:07,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:07,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:36:07,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:36:07,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:36:07,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 78 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:07,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,700 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:36:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-07-29 01:36:07,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:36:07,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:36:07,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:36:07,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:07,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 78 transitions. cyclomatic complexity: 20 [2020-07-29 01:36:07,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:07,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2020-07-29 01:36:07,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:36:07,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:36:07,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:36:07,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:36:07,705 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:07,705 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:07,705 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:07,705 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:36:07,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:36:07,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:07,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:36:07,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:36:07 BoogieIcfgContainer [2020-07-29 01:36:07,713 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:36:07,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:36:07,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:36:07,714 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:36:07,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:56" (3/4) ... [2020-07-29 01:36:07,718 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:36:07,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:36:07,720 INFO L168 Benchmark]: Toolchain (without parser) took 11824.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 961.6 MB in the beginning and 931.8 MB in the end (delta: 29.7 MB). Peak memory consumption was 359.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:07,721 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:07,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:07,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:07,723 INFO L168 Benchmark]: Boogie Preprocessor took 30.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:07,723 INFO L168 Benchmark]: RCFGBuilder took 414.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:07,724 INFO L168 Benchmark]: BuchiAutomizer took 10725.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 940.7 MB in the end (delta: 148.4 MB). Peak memory consumption was 338.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:07,725 INFO L168 Benchmark]: Witness Printer took 5.02 ms. Allocated memory is still 1.4 GB. Free memory was 940.7 MB in the beginning and 931.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:07,729 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 589.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 414.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10725.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 940.7 MB in the end (delta: 148.4 MB). Peak memory consumption was 338.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.02 ms. Allocated memory is still 1.4 GB. Free memory was 940.7 MB in the beginning and 931.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 91 SDtfs, 107 SDslu, 40 SDs, 0 SdLazy, 133 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital177 mio100 ax110 hnf99 lsp88 ukn91 mio100 lsp49 div100 bol101 ite100 ukn100 eq176 hnf88 smp100 dnf149 smp83 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 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! Received shutdown request...