./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_alloca.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-15/count_up_alloca.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 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:38:59,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:38:59,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:38:59,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:38:59,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:38:59,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:38:59,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:38:59,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:38:59,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:38:59,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:38:59,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:38:59,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:38:59,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:38:59,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:38:59,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:38:59,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:38:59,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:38:59,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:38:59,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:38:59,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:38:59,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:38:59,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:38:59,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:38:59,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:38:59,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:38:59,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:38:59,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:38:59,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:38:59,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:38:59,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:38:59,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:38:59,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:38:59,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:38:59,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:38:59,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:38:59,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:38:59,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:38:59,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:38:59,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:38:59,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:38:59,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:38:59,494 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:38:59,511 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:38:59,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:38:59,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:38:59,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:38:59,517 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:38:59,518 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:38:59,518 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:38:59,519 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:38:59,519 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:38:59,520 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:38:59,522 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:38:59,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:38:59,523 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:38:59,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:38:59,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:38:59,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:38:59,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:38:59,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:38:59,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:38:59,525 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:38:59,526 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:38:59,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:38:59,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:38:59,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:38:59,527 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:38:59,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:38:59,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:38:59,529 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:38:59,530 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:38:59,531 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:38:59,532 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 -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2020-07-29 01:38:59,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:38:59,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:38:59,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:38:59,824 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:38:59,825 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:38:59,825 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_alloca.i [2020-07-29 01:38:59,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c31d573/419678651a2c411fba333539aa8a4f16/FLAG23d931b2b [2020-07-29 01:39:00,405 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:00,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_alloca.i [2020-07-29 01:39:00,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c31d573/419678651a2c411fba333539aa8a4f16/FLAG23d931b2b [2020-07-29 01:39:00,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c31d573/419678651a2c411fba333539aa8a4f16 [2020-07-29 01:39:00,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:00,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:00,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:00,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:00,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:00,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:00" (1/1) ... [2020-07-29 01:39:00,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76497eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:00, skipping insertion in model container [2020-07-29 01:39:00,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:00" (1/1) ... [2020-07-29 01:39:00,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:00,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:01,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:01,277 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:01,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:01,443 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:01,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01 WrapperNode [2020-07-29 01:39:01,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:01,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:01,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:01,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:01,456 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:39:01" (1/1) ... [2020-07-29 01:39:01,472 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:39:01" (1/1) ... [2020-07-29 01:39:01,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:01,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:01,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:01,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:01,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (1/1) ... [2020-07-29 01:39:01,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (1/1) ... [2020-07-29 01:39:01,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (1/1) ... [2020-07-29 01:39:01,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (1/1) ... [2020-07-29 01:39:01,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (1/1) ... [2020-07-29 01:39:01,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (1/1) ... [2020-07-29 01:39:01,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (1/1) ... [2020-07-29 01:39:01,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:01,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:01,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:01,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:01,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (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:39:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:01,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:02,028 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:02,028 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:39:02,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:02 BoogieIcfgContainer [2020-07-29 01:39:02,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:02,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:02,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:02,035 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:02,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:02,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:00" (1/3) ... [2020-07-29 01:39:02,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75833c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:02, skipping insertion in model container [2020-07-29 01:39:02,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:02,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:01" (2/3) ... [2020-07-29 01:39:02,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75833c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:02, skipping insertion in model container [2020-07-29 01:39:02,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:02,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:02" (3/3) ... [2020-07-29 01:39:02,040 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_up_alloca.i [2020-07-29 01:39:02,082 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:02,082 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:02,082 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:02,083 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:02,083 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:02,083 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:02,084 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:02,084 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:02,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:02,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:39:02,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:02,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:02,122 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:02,122 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:39:02,122 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:02,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:02,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:39:02,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:02,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:02,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:02,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:39:02,133 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2020-07-29 01:39:02,134 INFO L796 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2020-07-29 01:39:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:39:02,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:02,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794095763] [2020-07-29 01:39:02,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:02,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:02,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:02,277 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2020-07-29 01:39:02,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:02,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875669910] [2020-07-29 01:39:02,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:02,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:02,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:02,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2020-07-29 01:39:02,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:02,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293557035] [2020-07-29 01:39:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:02,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:02,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:02,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:02,608 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2020-07-29 01:39:02,675 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:02,675 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:02,676 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:02,676 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:02,676 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:02,676 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:02,676 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:02,677 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:02,677 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration1_Lasso [2020-07-29 01:39:02,677 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:02,677 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:02,719 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:39:02,729 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:39:02,734 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:39:02,739 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:39:02,744 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:39:02,751 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:39:02,756 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:39:02,761 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:39:02,766 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:39:02,771 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:39:02,776 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:39:02,782 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:39:03,483 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:03,489 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) [2020-07-29 01:39:03,505 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:39:03,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:03,526 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:39:03,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:39:03,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,582 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:39:03,591 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) [2020-07-29 01:39:03,641 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:39:03,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:03,649 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) [2020-07-29 01:39:03,689 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:03,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:03,697 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:39:03,725 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:39:03,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:03,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:03,750 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) [2020-07-29 01:39:03,783 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:39:03,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:03,789 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:39:03,821 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:39:03,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:03,826 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:39:03,849 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:39:03,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:03,859 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:39:03,882 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:39:03,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:03,887 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:39:03,923 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:39:03,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:03,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:03,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:03,931 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:39:03,970 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:39:03,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:03,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:03,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:03,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:03,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:03,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:03,987 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:39:04,012 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:39:04,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:04,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:04,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:04,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:04,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:04,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:04,044 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:04,076 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:39:04,076 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. 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:39:04,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:04,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:04,085 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:04,086 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:39:04,140 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:39:04,146 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209;" "assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0;" "call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208;" [2020-07-29 01:39:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:04,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:04,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:04,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2020-07-29 01:39:04,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {28#unseeded} is VALID [2020-07-29 01:39:04,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length~0 < 1); {28#unseeded} is VALID [2020-07-29 01:39:04,311 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#unseeded} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {28#unseeded} is VALID [2020-07-29 01:39:04,312 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {28#unseeded} is VALID [2020-07-29 01:39:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:04,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:04,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:39:04,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:39:04,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:39:04,380 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {56#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:39:04,383 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:39:04,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:04,408 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:39:04,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,419 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:39:04,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-07-29 01:39:04,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2020-07-29 01:39:04,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:04,547 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:04,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:04,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:39:04,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:04,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:04,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:04,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:39:04,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:04,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:04,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 60 transitions. [2020-07-29 01:39:04,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:04,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:04,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:04,562 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states. [2020-07-29 01:39:04,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:39:04,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:39:04,567 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:04,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:39:04,571 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:04,571 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 60 transitions. cyclomatic complexity: 21 [2020-07-29 01:39:04,572 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:39:04,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:04,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:04,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:04,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:04,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:04,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:39:04,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:04,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:04,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:04,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:04,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:04,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:04,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:04,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:04,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:04,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:04,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:04,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:04,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:04,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:04,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:04,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:04,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:04,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:04,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:39:04,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:39:04,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:39:04,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:39:04,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:39:04,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:39:04,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:04,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:04,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:04,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:04,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:04,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:04,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:04,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:04,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:04,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:04,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:04,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:04,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:04,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:04,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:04,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:04,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,601 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-29 01:39:04,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:04,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:39:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:04,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:04,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. cyclomatic complexity: 21 [2020-07-29 01:39:04,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:04,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2020-07-29 01:39:04,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:04,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:04,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 01:39:04,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:04,619 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:39:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 01:39:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 01:39:04,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:04,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 01:39:04,648 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 01:39:04,652 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 01:39:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:04,657 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:39:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:39:04,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:04,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:04,658 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 01:39:04,659 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 01:39:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:04,660 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:39:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:39:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:04,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:04,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:04,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:39:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 01:39:04,664 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:39:04,664 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:39:04,664 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:04,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:39:04,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:04,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:04,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:04,666 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:04,666 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:39:04,666 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 143#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 144#L369 assume !(main_~length~0 < 1); 149#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 146#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 147#L372-3 assume !(main_~i~0 < main_~length~0); 150#L372-4 main_~j~0 := 0; 137#L379-3 [2020-07-29 01:39:04,666 INFO L796 eck$LassoCheckResult]: Loop: 137#L379-3 assume !!(main_~j~0 < main_~length~0); 138#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 139#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 136#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 137#L379-3 [2020-07-29 01:39:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2020-07-29 01:39:04,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35675535] [2020-07-29 01:39:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:04,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {184#true} is VALID [2020-07-29 01:39:04,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {184#true} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {184#true} is VALID [2020-07-29 01:39:04,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#true} assume !(main_~length~0 < 1); {186#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:39:04,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#(<= 1 ULTIMATE.start_main_~length~0)} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {186#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:39:04,738 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#(<= 1 ULTIMATE.start_main_~length~0)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {187#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:39:04,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {187#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} assume !(main_~i~0 < main_~length~0); {185#false} is VALID [2020-07-29 01:39:04,739 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#false} main_~j~0 := 0; {185#false} is VALID [2020-07-29 01:39:04,740 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:39:04,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35675535] [2020-07-29 01:39:04,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:04,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:39:04,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225464169] [2020-07-29 01:39:04,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:39:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2020-07-29 01:39:04,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673990770] [2020-07-29 01:39:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:04,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:04,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:39:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:39:04,806 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:39:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:04,870 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:39:04,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:04,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:04,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:39:04,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:04,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2020-07-29 01:39:04,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:39:04,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:04,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-07-29 01:39:04,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:04,884 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 01:39:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-07-29 01:39:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-07-29 01:39:04,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:04,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 23 transitions. Second operand 15 states. [2020-07-29 01:39:04,886 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 23 transitions. Second operand 15 states. [2020-07-29 01:39:04,886 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 15 states. [2020-07-29 01:39:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:04,888 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-29 01:39:04,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:04,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:04,889 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 18 states and 23 transitions. [2020-07-29 01:39:04,889 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 18 states and 23 transitions. [2020-07-29 01:39:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:04,890 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-29 01:39:04,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:04,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:04,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:04,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:39:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-07-29 01:39:04,893 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 01:39:04,893 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 01:39:04,893 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:04,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:39:04,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:04,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:04,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:04,895 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:04,895 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:39:04,895 INFO L794 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 215#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 216#L369 assume !(main_~length~0 < 1); 221#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 217#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 218#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 212#L374 assume !(main_~val~0 > main_~limit~0); 213#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 214#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 220#L372-3 assume !(main_~i~0 < main_~length~0); 222#L372-4 main_~j~0 := 0; 211#L379-3 [2020-07-29 01:39:04,895 INFO L796 eck$LassoCheckResult]: Loop: 211#L379-3 assume !!(main_~j~0 < main_~length~0); 208#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 209#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 210#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 211#L379-3 [2020-07-29 01:39:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2020-07-29 01:39:04,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877910571] [2020-07-29 01:39:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,927 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2020-07-29 01:39:04,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030323163] [2020-07-29 01:39:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2020-07-29 01:39:04,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062636957] [2020-07-29 01:39:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:05,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:05,209 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-07-29 01:39:05,276 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:05,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:05,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:05,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:05,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:05,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:05,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:05,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:05,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration3_Lasso [2020-07-29 01:39:05,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:05,278 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:05,299 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:39:05,303 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:39:05,306 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:39:05,309 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:39:05,312 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:39:05,317 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:39:05,323 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:39:05,326 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:39:05,330 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:39:05,471 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:39:05,475 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:39:05,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:39:05,483 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:39:05,928 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:05,928 INFO L489 LassoAnalysis]: Using template 'affine'. 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:39:05,939 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:39:05,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:05,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:05,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:05,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:05,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:05,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:05,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:05,944 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:05,969 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:39:05,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:05,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:05,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:05,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:05,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:05,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:05,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:05,974 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:39:06,011 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:39:06,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:06,018 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:06,058 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:39:06,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,064 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:06,100 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:06,106 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:39:06,144 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:39:06,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:06,154 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:39:06,208 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:39:06,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:06,211 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:06,245 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:39:06,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,255 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:06,287 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:39:06,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,300 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:39:06,332 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:39:06,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,345 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,371 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:39:06,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:06,384 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) [2020-07-29 01:39:06,417 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:39:06,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,439 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:06,477 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 01:39:06,477 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. 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) [2020-07-29 01:39:06,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,483 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:06,484 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:06,484 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:39:06,523 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:39:06,527 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < main_~length~0);" "call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;" "main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210;" [2020-07-29 01:39:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:06,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {268#unseeded} is VALID [2020-07-29 01:39:06,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {268#unseeded} is VALID [2020-07-29 01:39:06,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {268#unseeded} assume !(main_~length~0 < 1); {268#unseeded} is VALID [2020-07-29 01:39:06,579 INFO L280 TraceCheckUtils]: 3: Hoare triple {268#unseeded} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {268#unseeded} is VALID [2020-07-29 01:39:06,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {268#unseeded} is VALID [2020-07-29 01:39:06,580 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {268#unseeded} is VALID [2020-07-29 01:39:06,582 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#unseeded} assume !(main_~val~0 > main_~limit~0); {268#unseeded} is VALID [2020-07-29 01:39:06,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {268#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {268#unseeded} is VALID [2020-07-29 01:39:06,583 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {268#unseeded} is VALID [2020-07-29 01:39:06,584 INFO L280 TraceCheckUtils]: 9: Hoare triple {268#unseeded} assume !(main_~i~0 < main_~length~0); {268#unseeded} is VALID [2020-07-29 01:39:06,584 INFO L280 TraceCheckUtils]: 10: Hoare triple {268#unseeded} main_~j~0 := 0; {268#unseeded} is VALID [2020-07-29 01:39:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:06,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))} assume !!(main_~j~0 < main_~length~0); {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:39:06,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:39:06,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:39:06,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; {296#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:39:06,626 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:39:06,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:06,637 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:39:06,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,638 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:39:06,638 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:39:06,683 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2020-07-29 01:39:06,683 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:39:06,684 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:06,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:06,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:06,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:06,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:06,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:06,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:06,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:06,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:39:06,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:06,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:06,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:06,689 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:06,693 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:39:06,693 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:06,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:06,694 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:06,696 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:06,696 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:06,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:06,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:06,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:06,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:39:06,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:39:06,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:39:06,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:39:06,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:39:06,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:39:06,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:06,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:06,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:06,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:06,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:06,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:06,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:39:06,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:39:06,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:39:06,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:06,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:06,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:06,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:06,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:06,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:06,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:06,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,715 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:39:06,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:39:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:06,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:06,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2020-07-29 01:39:06,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:06,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:06,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2020-07-29 01:39:06,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:06,725 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 01:39:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2020-07-29 01:39:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 01:39:06,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:06,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:06,727 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:06,727 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:06,729 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:06,731 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-29 01:39:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:39:06,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:06,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:06,732 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 25 transitions. [2020-07-29 01:39:06,732 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 25 transitions. [2020-07-29 01:39:06,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:06,735 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 01:39:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:39:06,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:06,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:06,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:06,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-07-29 01:39:06,737 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 01:39:06,737 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 01:39:06,737 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:39:06,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:39:06,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:06,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:06,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:06,738 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:06,739 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:06,739 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 377#L369 assume !(main_~length~0 < 1); 383#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 380#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 381#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 374#L374 assume !(main_~val~0 > main_~limit~0); 375#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 378#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 382#L372-3 assume !(main_~i~0 < main_~length~0); 384#L372-4 main_~j~0 := 0; 373#L379-3 assume !!(main_~j~0 < main_~length~0); 367#L380-3 [2020-07-29 01:39:06,739 INFO L796 eck$LassoCheckResult]: Loop: 367#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 368#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 367#L380-3 [2020-07-29 01:39:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2020-07-29 01:39:06,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:06,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487284964] [2020-07-29 01:39:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:06,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:06,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:06,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2020-07-29 01:39:06,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:06,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932763089] [2020-07-29 01:39:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:06,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:06,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:06,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2020-07-29 01:39:06,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:06,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482293931] [2020-07-29 01:39:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:06,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:06,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:06,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:07,004 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-07-29 01:39:07,103 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:07,103 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:07,103 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:07,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:07,103 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:07,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:07,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:07,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:07,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration4_Lasso [2020-07-29 01:39:07,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:07,104 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:07,126 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:39:07,133 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:39:07,138 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:39:07,333 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:39:07,339 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:39:07,342 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:39:07,345 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:39:07,348 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:39:07,352 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:39:07,355 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:39:07,358 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:39:07,361 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:39:07,848 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:07,848 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:39:07,852 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:07,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:07,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:07,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:07,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:07,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:07,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:07,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:07,856 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:39:07,877 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:39:07,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:07,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:07,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:07,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:07,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:07,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:07,883 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:39:07,905 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:39:07,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:07,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:07,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:07,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:07,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:07,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:07,919 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:07,928 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:39:07,928 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:07,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:07,931 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:07,931 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:07,932 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))_1) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))_1 Supporting invariants [] [2020-07-29 01:39:07,967 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:39:07,972 INFO L393 LassoCheck]: Loop: "call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212;" [2020-07-29 01:39:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:07,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:39:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:39:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:08,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {494#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {494#unseeded} is VALID [2020-07-29 01:39:08,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {494#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {494#unseeded} is VALID [2020-07-29 01:39:08,088 INFO L280 TraceCheckUtils]: 2: Hoare triple {494#unseeded} assume !(main_~length~0 < 1); {494#unseeded} is VALID [2020-07-29 01:39:08,089 INFO L280 TraceCheckUtils]: 3: Hoare triple {494#unseeded} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {494#unseeded} is VALID [2020-07-29 01:39:08,089 INFO L280 TraceCheckUtils]: 4: Hoare triple {494#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:39:08,090 INFO L280 TraceCheckUtils]: 5: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:39:08,090 INFO L280 TraceCheckUtils]: 6: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} assume !(main_~val~0 > main_~limit~0); {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:39:08,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:39:08,092 INFO L280 TraceCheckUtils]: 8: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:39:08,093 INFO L280 TraceCheckUtils]: 9: Hoare triple {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} assume !(main_~i~0 < main_~length~0); {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:39:08,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} main_~j~0 := 0; {569#(and (= 0 ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:39:08,094 INFO L280 TraceCheckUtils]: 11: Hoare triple {569#(and (= 0 ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start_main_~i~0) unseeded)} assume !!(main_~j~0 < main_~length~0); {528#(and unseeded (= (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} is VALID [2020-07-29 01:39:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:39:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:08,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {529#(and (>= oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))))) (= (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {573#(and (<= ULTIMATE.start_main_~limit~0 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4))))) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|) (= (* 4 ULTIMATE.start_main_~i~0) (+ (* 4 ULTIMATE.start_main_~j~0) 4)))} is VALID [2020-07-29 01:39:08,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {573#(and (<= ULTIMATE.start_main_~limit~0 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4))))) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|) (= (* 4 ULTIMATE.start_main_~i~0) (+ (* 4 ULTIMATE.start_main_~j~0) 4)))} assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; {531#(and (or (and (>= oldRank0 0) (> oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4))))))) unseeded) (= (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} is VALID [2020-07-29 01:39:08,143 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:39:08,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:39:08,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:08,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,160 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 01:39:08,160 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-29 01:39:08,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 39 states and 51 transitions. Complement of second has 11 states. [2020-07-29 01:39:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 01:39:08,334 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:08,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:08,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:39:08,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2020-07-29 01:39:08,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,341 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:08,342 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:08,342 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:39:08,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,344 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:08,344 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 51 transitions. cyclomatic complexity: 17 [2020-07-29 01:39:08,345 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:08,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:39:08,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:39:08,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:39:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:39:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:39:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:39:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:39:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:39:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:39:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:39:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:39:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:39:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:39:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:39:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:39:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:39:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,354 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:39:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-29 01:39:08,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:39:08,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:08,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:39:08,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. cyclomatic complexity: 17 [2020-07-29 01:39:08,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 44 transitions. [2020-07-29 01:39:08,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:39:08,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:39:08,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-07-29 01:39:08,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:08,360 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 01:39:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-07-29 01:39:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-07-29 01:39:08,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:08,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 44 transitions. Second operand 27 states. [2020-07-29 01:39:08,363 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 44 transitions. Second operand 27 states. [2020-07-29 01:39:08,363 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 27 states. [2020-07-29 01:39:08,363 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:08,365 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 01:39:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-29 01:39:08,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:08,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:08,366 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 34 states and 44 transitions. [2020-07-29 01:39:08,366 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 34 states and 44 transitions. [2020-07-29 01:39:08,367 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:08,369 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-07-29 01:39:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-07-29 01:39:08,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:08,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:08,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:08,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:39:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-29 01:39:08,371 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-29 01:39:08,371 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-29 01:39:08,371 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:39:08,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2020-07-29 01:39:08,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,373 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:08,373 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:08,373 INFO L794 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 648#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 649#L369 assume !(main_~length~0 < 1); 656#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 652#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 653#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 657#L374 assume !(main_~val~0 > main_~limit~0); 663#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 654#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 655#L372-3 assume !(main_~i~0 < main_~length~0); 658#L372-4 main_~j~0 := 0; 644#L379-3 assume !!(main_~j~0 < main_~length~0); 645#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 664#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 642#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 643#L379-3 assume !!(main_~j~0 < main_~length~0); 638#L380-3 [2020-07-29 01:39:08,373 INFO L796 eck$LassoCheckResult]: Loop: 638#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 639#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 638#L380-3 [2020-07-29 01:39:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2020-07-29 01:39:08,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:08,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841386525] [2020-07-29 01:39:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {827#true} is VALID [2020-07-29 01:39:08,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {827#true} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {827#true} is VALID [2020-07-29 01:39:08,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {827#true} assume !(main_~length~0 < 1); {827#true} is VALID [2020-07-29 01:39:08,444 INFO L280 TraceCheckUtils]: 3: Hoare triple {827#true} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {827#true} is VALID [2020-07-29 01:39:08,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {827#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:39:08,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:39:08,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~val~0 > main_~limit~0); {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:39:08,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:39:08,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {830#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:39:08,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {831#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:08,458 INFO L280 TraceCheckUtils]: 10: Hoare triple {831#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,459 INFO L280 TraceCheckUtils]: 11: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,460 INFO L280 TraceCheckUtils]: 13: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,461 INFO L280 TraceCheckUtils]: 14: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; {833#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:39:08,461 INFO L280 TraceCheckUtils]: 15: Hoare triple {833#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < main_~length~0); {828#false} is VALID [2020-07-29 01:39:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:08,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841386525] [2020-07-29 01:39:08,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934761914] [2020-07-29 01:39:08,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:39:08,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:39:08,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:39:08,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:39:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:08,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {827#true} is VALID [2020-07-29 01:39:08,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {827#true} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {827#true} is VALID [2020-07-29 01:39:08,654 INFO L280 TraceCheckUtils]: 2: Hoare triple {827#true} assume !(main_~length~0 < 1); {827#true} is VALID [2020-07-29 01:39:08,655 INFO L280 TraceCheckUtils]: 3: Hoare triple {827#true} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {827#true} is VALID [2020-07-29 01:39:08,656 INFO L280 TraceCheckUtils]: 4: Hoare triple {827#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:39:08,657 INFO L280 TraceCheckUtils]: 5: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:39:08,658 INFO L280 TraceCheckUtils]: 6: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_~val~0 > main_~limit~0); {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:39:08,658 INFO L280 TraceCheckUtils]: 7: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:39:08,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {830#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:39:08,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {831#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:08,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {831#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,661 INFO L280 TraceCheckUtils]: 12: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,662 INFO L280 TraceCheckUtils]: 13: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; {881#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:08,664 INFO L280 TraceCheckUtils]: 15: Hoare triple {881#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {828#false} is VALID [2020-07-29 01:39:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:08,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:39:08,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 01:39:08,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935450485] [2020-07-29 01:39:08,666 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:39:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2020-07-29 01:39:08,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:08,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197198165] [2020-07-29 01:39:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:08,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:08,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:08,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:08,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:39:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:39:08,724 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand 10 states. [2020-07-29 01:39:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:09,030 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-07-29 01:39:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:39:09,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:39:09,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:09,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2020-07-29 01:39:09,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:09,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 51 transitions. [2020-07-29 01:39:09,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:39:09,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:39:09,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2020-07-29 01:39:09,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:09,080 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2020-07-29 01:39:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2020-07-29 01:39:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2020-07-29 01:39:09,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:09,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states and 51 transitions. Second operand 35 states. [2020-07-29 01:39:09,083 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states and 51 transitions. Second operand 35 states. [2020-07-29 01:39:09,083 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 35 states. [2020-07-29 01:39:09,084 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,086 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-29 01:39:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-29 01:39:09,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,087 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states and 51 transitions. [2020-07-29 01:39:09,087 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states and 51 transitions. [2020-07-29 01:39:09,088 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,091 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-29 01:39:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-29 01:39:09,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:09,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 01:39:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-07-29 01:39:09,093 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-29 01:39:09,093 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-29 01:39:09,093 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:39:09,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-07-29 01:39:09,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:09,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:09,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:09,095 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:09,095 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:09,095 INFO L794 eck$LassoCheckResult]: Stem: 955#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 953#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 954#L369 assume main_~length~0 < 1;main_~length~0 := 1; 961#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 976#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 975#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 974#L374 assume !(main_~val~0 > main_~limit~0); 973#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 972#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 971#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 968#L374 assume !(main_~val~0 > main_~limit~0); 970#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 969#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 967#L372-3 assume !(main_~i~0 < main_~length~0); 963#L372-4 main_~j~0 := 0; 949#L379-3 assume !!(main_~j~0 < main_~length~0); 943#L380-3 [2020-07-29 01:39:09,095 INFO L796 eck$LassoCheckResult]: Loop: 943#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 944#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 943#L380-3 [2020-07-29 01:39:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash -420071865, now seen corresponding path program 1 times [2020-07-29 01:39:09,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321898376] [2020-07-29 01:39:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:09,142 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1202#true} is VALID [2020-07-29 01:39:09,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#true} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {1202#true} is VALID [2020-07-29 01:39:09,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {1202#true} assume main_~length~0 < 1;main_~length~0 := 1; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:09,144 INFO L280 TraceCheckUtils]: 3: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:09,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,145 INFO L280 TraceCheckUtils]: 5: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} assume !(main_~val~0 > main_~limit~0); {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1206#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:39:09,148 INFO L280 TraceCheckUtils]: 9: Hoare triple {1206#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1203#false} is VALID [2020-07-29 01:39:09,148 INFO L280 TraceCheckUtils]: 10: Hoare triple {1203#false} assume !(main_~val~0 > main_~limit~0); {1203#false} is VALID [2020-07-29 01:39:09,148 INFO L280 TraceCheckUtils]: 11: Hoare triple {1203#false} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1203#false} is VALID [2020-07-29 01:39:09,149 INFO L280 TraceCheckUtils]: 12: Hoare triple {1203#false} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1203#false} is VALID [2020-07-29 01:39:09,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {1203#false} assume !(main_~i~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:39:09,149 INFO L280 TraceCheckUtils]: 14: Hoare triple {1203#false} main_~j~0 := 0; {1203#false} is VALID [2020-07-29 01:39:09,149 INFO L280 TraceCheckUtils]: 15: Hoare triple {1203#false} assume !!(main_~j~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:39:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:09,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321898376] [2020-07-29 01:39:09,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192815946] [2020-07-29 01:39:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:39:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:09,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:09,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:09,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1202#true} is VALID [2020-07-29 01:39:09,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#true} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {1202#true} is VALID [2020-07-29 01:39:09,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {1202#true} assume main_~length~0 < 1;main_~length~0 := 1; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:09,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:09,300 INFO L280 TraceCheckUtils]: 4: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,301 INFO L280 TraceCheckUtils]: 5: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,302 INFO L280 TraceCheckUtils]: 6: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} assume !(main_~val~0 > main_~limit~0); {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,302 INFO L280 TraceCheckUtils]: 7: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,303 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1235#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:39:09,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {1235#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1203#false} is VALID [2020-07-29 01:39:09,304 INFO L280 TraceCheckUtils]: 10: Hoare triple {1203#false} assume !(main_~val~0 > main_~limit~0); {1203#false} is VALID [2020-07-29 01:39:09,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {1203#false} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1203#false} is VALID [2020-07-29 01:39:09,305 INFO L280 TraceCheckUtils]: 12: Hoare triple {1203#false} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1203#false} is VALID [2020-07-29 01:39:09,305 INFO L280 TraceCheckUtils]: 13: Hoare triple {1203#false} assume !(main_~i~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:39:09,305 INFO L280 TraceCheckUtils]: 14: Hoare triple {1203#false} main_~j~0 := 0; {1203#false} is VALID [2020-07-29 01:39:09,306 INFO L280 TraceCheckUtils]: 15: Hoare triple {1203#false} assume !!(main_~j~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:39:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:09,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:39:09,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-07-29 01:39:09,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996407658] [2020-07-29 01:39:09,307 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:39:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2020-07-29 01:39:09,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27301194] [2020-07-29 01:39:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,327 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:09,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:09,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:39:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:39:09,372 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-07-29 01:39:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:09,468 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 01:39:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:39:09,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:39:09,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:09,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-07-29 01:39:09,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:09,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 28 transitions. [2020-07-29 01:39:09,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:09,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:09,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-07-29 01:39:09,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:09,500 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:39:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-07-29 01:39:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-29 01:39:09,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:09,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 28 transitions. Second operand 22 states. [2020-07-29 01:39:09,502 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 28 transitions. Second operand 22 states. [2020-07-29 01:39:09,503 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 22 states. [2020-07-29 01:39:09,504 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,505 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:39:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:39:09,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,506 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states and 28 transitions. [2020-07-29 01:39:09,507 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states and 28 transitions. [2020-07-29 01:39:09,507 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,509 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:39:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:39:09,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:09,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:39:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-07-29 01:39:09,512 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:39:09,512 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:39:09,512 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:39:09,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:39:09,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:09,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:09,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:09,514 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:09,514 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:09,514 INFO L794 eck$LassoCheckResult]: Stem: 1297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1294#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 1295#L369 assume !(main_~length~0 < 1); 1301#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 1298#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1299#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 1302#L374 assume !(main_~val~0 > main_~limit~0); 1306#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1305#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 1303#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 1292#L374 assume !(main_~val~0 > main_~limit~0); 1293#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1296#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 1300#L372-3 assume !(main_~i~0 < main_~length~0); 1304#L372-4 main_~j~0 := 0; 1291#L379-3 assume !!(main_~j~0 < main_~length~0); 1285#L380-3 [2020-07-29 01:39:09,515 INFO L796 eck$LassoCheckResult]: Loop: 1285#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1286#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 1285#L380-3 [2020-07-29 01:39:09,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1431189115, now seen corresponding path program 2 times [2020-07-29 01:39:09,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141892872] [2020-07-29 01:39:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 4 times [2020-07-29 01:39:09,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299164773] [2020-07-29 01:39:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,558 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash -983203254, now seen corresponding path program 2 times [2020-07-29 01:39:09,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261444810] [2020-07-29 01:39:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:09,908 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2020-07-29 01:39:10,055 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:10,055 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:10,056 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:10,056 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:10,056 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:10,056 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:10,056 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:10,056 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:10,057 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration7_Lasso [2020-07-29 01:39:10,057 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:10,057 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:10,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:10,195 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:39:10,195 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:39:10,198 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:39:10,202 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:39:10,205 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:39:10,208 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:39:10,212 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:39:10,215 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:39:10,217 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:39:10,222 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:39:10,226 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:39:10,229 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:39:10,232 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:39:10,235 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:39:10,658 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:10,659 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:10,661 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:39:10,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:10,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:10,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:10,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:10,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:10,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:10,671 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:10,691 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:39:10,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:10,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:10,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:10,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:10,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:10,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:10,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:10,718 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:39:10,718 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:10,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:10,723 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:10,723 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:10,723 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3, ULTIMATE.start_main_~limit~0) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3 + 1*ULTIMATE.start_main_~limit~0 Supporting invariants [] [2020-07-29 01:39:10,754 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:39:10,758 INFO L393 LassoCheck]: Loop: "call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212;" [2020-07-29 01:39:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:10,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:39:10,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:10,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:10,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:10,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {1436#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1436#unseeded} is VALID [2020-07-29 01:39:10,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {1436#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {1436#unseeded} is VALID [2020-07-29 01:39:10,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {1436#unseeded} assume !(main_~length~0 < 1); {1436#unseeded} is VALID [2020-07-29 01:39:10,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {1436#unseeded} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {1436#unseeded} is VALID [2020-07-29 01:39:10,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {1436#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1436#unseeded} is VALID [2020-07-29 01:39:10,805 INFO L280 TraceCheckUtils]: 5: Hoare triple {1436#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1436#unseeded} is VALID [2020-07-29 01:39:10,806 INFO L280 TraceCheckUtils]: 6: Hoare triple {1436#unseeded} assume !(main_~val~0 > main_~limit~0); {1436#unseeded} is VALID [2020-07-29 01:39:10,806 INFO L280 TraceCheckUtils]: 7: Hoare triple {1436#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1436#unseeded} is VALID [2020-07-29 01:39:10,806 INFO L280 TraceCheckUtils]: 8: Hoare triple {1436#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1436#unseeded} is VALID [2020-07-29 01:39:10,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {1436#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1436#unseeded} is VALID [2020-07-29 01:39:10,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {1436#unseeded} assume !(main_~val~0 > main_~limit~0); {1436#unseeded} is VALID [2020-07-29 01:39:10,812 INFO L280 TraceCheckUtils]: 11: Hoare triple {1436#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1436#unseeded} is VALID [2020-07-29 01:39:10,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {1436#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1436#unseeded} is VALID [2020-07-29 01:39:10,815 INFO L280 TraceCheckUtils]: 13: Hoare triple {1436#unseeded} assume !(main_~i~0 < main_~length~0); {1436#unseeded} is VALID [2020-07-29 01:39:10,816 INFO L280 TraceCheckUtils]: 14: Hoare triple {1436#unseeded} main_~j~0 := 0; {1436#unseeded} is VALID [2020-07-29 01:39:10,816 INFO L280 TraceCheckUtils]: 15: Hoare triple {1436#unseeded} assume !!(main_~j~0 < main_~length~0); {1436#unseeded} is VALID [2020-07-29 01:39:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:10,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:10,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:10,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {1439#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))) ULTIMATE.start_main_~limit~0))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1514#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} is VALID [2020-07-29 01:39:10,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {1514#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; {1464#(or (and (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))) ULTIMATE.start_main_~limit~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:10,851 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:39:10,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:10,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:10,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,861 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:39:10,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:39:10,915 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2020-07-29 01:39:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:10,916 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:10,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:10,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:10,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:10,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:10,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:10,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:10,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:10,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2020-07-29 01:39:10,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:10,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:10,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:10,924 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:10,925 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:10,925 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:10,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:10,925 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:10,926 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 39 transitions. cyclomatic complexity: 13 [2020-07-29 01:39:10,926 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:10,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:10,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:10,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:10,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:10,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:10,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:10,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:39:10,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:39:10,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:39:10,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:39:10,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:39:10,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:39:10,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:10,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:10,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:10,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:39:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:39:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:39:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:10,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:10,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,934 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:39:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:39:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:39:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:10,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. cyclomatic complexity: 13 [2020-07-29 01:39:10,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:10,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 32 transitions. [2020-07-29 01:39:10,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:10,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:10,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2020-07-29 01:39:10,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:10,938 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-29 01:39:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2020-07-29 01:39:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-29 01:39:10,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:10,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 32 transitions. Second operand 25 states. [2020-07-29 01:39:10,942 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 32 transitions. Second operand 25 states. [2020-07-29 01:39:10,942 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 25 states. [2020-07-29 01:39:10,942 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:10,943 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-29 01:39:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-29 01:39:10,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:10,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:10,944 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states and 32 transitions. [2020-07-29 01:39:10,944 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states and 32 transitions. [2020-07-29 01:39:10,945 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:10,946 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-29 01:39:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-29 01:39:10,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:10,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:10,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:10,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:39:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-29 01:39:10,947 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 01:39:10,948 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 01:39:10,948 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:39:10,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-07-29 01:39:10,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:10,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:10,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:10,949 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:10,949 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:10,949 INFO L794 eck$LassoCheckResult]: Stem: 1572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1569#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 1570#L369 assume !(main_~length~0 < 1); 1576#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 1573#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1574#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 1567#L374 assume !(main_~val~0 > main_~limit~0); 1568#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1571#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 1575#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 1577#L374 assume !(main_~val~0 > main_~limit~0); 1582#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1581#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 1580#L372-3 assume !(main_~i~0 < main_~length~0); 1579#L372-4 main_~j~0 := 0; 1565#L379-3 assume !!(main_~j~0 < main_~length~0); 1566#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1578#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 1563#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 1564#L379-3 assume !!(main_~j~0 < main_~length~0); 1559#L380-3 [2020-07-29 01:39:10,949 INFO L796 eck$LassoCheckResult]: Loop: 1559#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1560#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; 1559#L380-3 [2020-07-29 01:39:10,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2020-07-29 01:39:10,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:10,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417523728] [2020-07-29 01:39:10,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:10,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:10,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:10,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 5 times [2020-07-29 01:39:10,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:10,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463441460] [2020-07-29 01:39:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:10,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:10,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:10,987 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2020-07-29 01:39:10,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:10,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232135797] [2020-07-29 01:39:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:11,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:11,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:11,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:11,311 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2020-07-29 01:39:11,441 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:11,441 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:11,441 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:11,441 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:11,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:11,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:11,442 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:11,442 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:11,442 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration8_Lasso [2020-07-29 01:39:11,442 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:11,442 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:11,456 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:39:11,460 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:39:11,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:39:11,467 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:39:11,471 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:39:11,613 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:39:11,613 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:39:11,616 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:39:11,620 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:39:11,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:11,627 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:39:11,630 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:39:11,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:11,636 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:39:12,067 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:12,067 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:12,070 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:39:12,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:12,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:12,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:12,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:12,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:12,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:12,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:12,074 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:12,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:39:12,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:12,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:12,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:12,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:12,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:12,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:12,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:12,099 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:12,121 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:39:12,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:12,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:12,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:12,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:12,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:12,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:12,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:12,125 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:12,147 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:39:12,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:12,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:12,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:12,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:12,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:12,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:12,154 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:12,175 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:39:12,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:12,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:12,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:12,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:12,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:12,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:12,201 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:12,249 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:39:12,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:12,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:12,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:12,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:12,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:12,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:12,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:12,283 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:39:12,284 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:12,288 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:12,291 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:12,292 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:12,292 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_4) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_4 Supporting invariants [] [2020-07-29 01:39:12,333 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:39:12,336 INFO L393 LassoCheck]: Loop: "call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212;" [2020-07-29 01:39:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:39:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:12,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {1728#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1728#unseeded} is VALID [2020-07-29 01:39:12,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {1728#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {1728#unseeded} is VALID [2020-07-29 01:39:12,389 INFO L280 TraceCheckUtils]: 2: Hoare triple {1728#unseeded} assume !(main_~length~0 < 1); {1728#unseeded} is VALID [2020-07-29 01:39:12,390 INFO L280 TraceCheckUtils]: 3: Hoare triple {1728#unseeded} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {1728#unseeded} is VALID [2020-07-29 01:39:12,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {1728#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:39:12,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1728#unseeded} is VALID [2020-07-29 01:39:12,391 INFO L280 TraceCheckUtils]: 6: Hoare triple {1728#unseeded} assume !(main_~val~0 > main_~limit~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,391 INFO L280 TraceCheckUtils]: 7: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,392 INFO L280 TraceCheckUtils]: 8: Hoare triple {1728#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1728#unseeded} is VALID [2020-07-29 01:39:12,392 INFO L280 TraceCheckUtils]: 9: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1728#unseeded} is VALID [2020-07-29 01:39:12,393 INFO L280 TraceCheckUtils]: 10: Hoare triple {1728#unseeded} assume !(main_~val~0 > main_~limit~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,393 INFO L280 TraceCheckUtils]: 11: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,394 INFO L280 TraceCheckUtils]: 12: Hoare triple {1728#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1728#unseeded} is VALID [2020-07-29 01:39:12,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {1728#unseeded} assume !(main_~i~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {1728#unseeded} main_~j~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:39:12,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,396 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#unseeded} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,397 INFO L280 TraceCheckUtils]: 17: Hoare triple {1728#unseeded} assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; {1728#unseeded} is VALID [2020-07-29 01:39:12,397 INFO L280 TraceCheckUtils]: 18: Hoare triple {1728#unseeded} main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; {1728#unseeded} is VALID [2020-07-29 01:39:12,398 INFO L280 TraceCheckUtils]: 19: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:12,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {1731#(>= oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1823#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} is VALID [2020-07-29 01:39:12,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {1823#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; {1761#(or (and (> oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:12,431 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:39:12,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:12,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,449 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:39:12,449 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:39:12,495 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2020-07-29 01:39:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:12,495 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:12,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:12,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-07-29 01:39:12,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,498 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,499 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:12,499 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:12,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,499 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:12,499 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,500 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:12,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:39:12,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:39:12,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:39:12,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,508 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:39:12,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,510 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:12,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {1728#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1728#unseeded} is VALID [2020-07-29 01:39:12,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {1728#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {1728#unseeded} is VALID [2020-07-29 01:39:12,591 INFO L280 TraceCheckUtils]: 2: Hoare triple {1728#unseeded} assume !(main_~length~0 < 1); {1728#unseeded} is VALID [2020-07-29 01:39:12,592 INFO L280 TraceCheckUtils]: 3: Hoare triple {1728#unseeded} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {1728#unseeded} is VALID [2020-07-29 01:39:12,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {1728#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:39:12,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1728#unseeded} is VALID [2020-07-29 01:39:12,593 INFO L280 TraceCheckUtils]: 6: Hoare triple {1728#unseeded} assume !(main_~val~0 > main_~limit~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,602 INFO L280 TraceCheckUtils]: 7: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,603 INFO L280 TraceCheckUtils]: 8: Hoare triple {1728#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1728#unseeded} is VALID [2020-07-29 01:39:12,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1728#unseeded} is VALID [2020-07-29 01:39:12,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {1728#unseeded} assume !(main_~val~0 > main_~limit~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,604 INFO L280 TraceCheckUtils]: 11: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {1728#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1728#unseeded} is VALID [2020-07-29 01:39:12,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {1728#unseeded} assume !(main_~i~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {1728#unseeded} main_~j~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:39:12,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#unseeded} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,607 INFO L280 TraceCheckUtils]: 17: Hoare triple {1728#unseeded} assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; {1728#unseeded} is VALID [2020-07-29 01:39:12,607 INFO L280 TraceCheckUtils]: 18: Hoare triple {1728#unseeded} main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; {1728#unseeded} is VALID [2020-07-29 01:39:12,608 INFO L280 TraceCheckUtils]: 19: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:12,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {1731#(>= oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1927#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} is VALID [2020-07-29 01:39:12,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {1927#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; {1761#(or (and (> oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:12,646 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:39:12,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:12,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:12,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:39:12,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:39:12,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2020-07-29 01:39:12,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:12,694 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:12,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:12,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-07-29 01:39:12,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,696 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,696 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:12,696 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:12,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,697 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:12,697 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,697 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:12,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:39:12,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:39:12,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:39:12,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,709 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:39:12,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,710 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:12,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {1728#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1728#unseeded} is VALID [2020-07-29 01:39:12,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {1728#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; {1728#unseeded} is VALID [2020-07-29 01:39:12,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {1728#unseeded} assume !(main_~length~0 < 1); {1728#unseeded} is VALID [2020-07-29 01:39:12,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {1728#unseeded} call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; {1728#unseeded} is VALID [2020-07-29 01:39:12,767 INFO L280 TraceCheckUtils]: 4: Hoare triple {1728#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:39:12,768 INFO L280 TraceCheckUtils]: 5: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1728#unseeded} is VALID [2020-07-29 01:39:12,769 INFO L280 TraceCheckUtils]: 6: Hoare triple {1728#unseeded} assume !(main_~val~0 > main_~limit~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,769 INFO L280 TraceCheckUtils]: 7: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,770 INFO L280 TraceCheckUtils]: 8: Hoare triple {1728#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1728#unseeded} is VALID [2020-07-29 01:39:12,770 INFO L280 TraceCheckUtils]: 9: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; {1728#unseeded} is VALID [2020-07-29 01:39:12,770 INFO L280 TraceCheckUtils]: 10: Hoare triple {1728#unseeded} assume !(main_~val~0 > main_~limit~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,771 INFO L280 TraceCheckUtils]: 11: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,771 INFO L280 TraceCheckUtils]: 12: Hoare triple {1728#unseeded} main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; {1728#unseeded} is VALID [2020-07-29 01:39:12,772 INFO L280 TraceCheckUtils]: 13: Hoare triple {1728#unseeded} assume !(main_~i~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,772 INFO L280 TraceCheckUtils]: 14: Hoare triple {1728#unseeded} main_~j~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:39:12,773 INFO L280 TraceCheckUtils]: 15: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,773 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#unseeded} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1728#unseeded} is VALID [2020-07-29 01:39:12,774 INFO L280 TraceCheckUtils]: 17: Hoare triple {1728#unseeded} assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; {1728#unseeded} is VALID [2020-07-29 01:39:12,774 INFO L280 TraceCheckUtils]: 18: Hoare triple {1728#unseeded} main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; {1728#unseeded} is VALID [2020-07-29 01:39:12,774 INFO L280 TraceCheckUtils]: 19: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:39:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:12,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:12,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {1731#(>= oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))))} call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {2031#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} is VALID [2020-07-29 01:39:12,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {2031#(and (<= ULTIMATE.start_main_~limit~0 (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem211|))} assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post213;havoc main_#t~mem212; {1761#(or (and (> oldRank0 (+ ULTIMATE.start_main_~limit~0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:12,808 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:39:12,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:12,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,818 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:39:12,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:39:12,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2020-07-29 01:39:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:12,870 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:12,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:12,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:12,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:12,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2020-07-29 01:39:12,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:12,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:12,873 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:39:12,873 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:12,873 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:12,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:12,874 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:12,874 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:39:12,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:39:12,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:12,874 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:39:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:39:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:39:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:39:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:39:12,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:12,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:39:12,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:12,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,880 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-29 01:39:12,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:39:12,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2020-07-29 01:39:12,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:39:12,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:12,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:39:12,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:12,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2020-07-29 01:39:12,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:12,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:12,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:12,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:12,883 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:12,883 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:12,883 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:12,883 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:39:12,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:12,884 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:12,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:12,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:12 BoogieIcfgContainer [2020-07-29 01:39:12,889 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:12,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:12,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:12,889 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:12,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:02" (3/4) ... [2020-07-29 01:39:12,892 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:12,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:12,894 INFO L168 Benchmark]: Toolchain (without parser) took 12174.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 958.9 MB in the beginning and 1.3 GB in the end (delta: -367.1 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:12,894 INFO L168 Benchmark]: CDTParser took 0.26 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:39:12,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -147.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:12,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.61 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:39:12,896 INFO L168 Benchmark]: Boogie Preprocessor took 38.99 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:39:12,896 INFO L168 Benchmark]: RCFGBuilder took 482.59 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:12,897 INFO L168 Benchmark]: BuchiAutomizer took 10857.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -250.5 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:12,897 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:12,899 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.26 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 721.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -147.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.61 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. * Boogie Preprocessor took 38.99 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. * RCFGBuilder took 482.59 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10857.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -250.5 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][arr + i * 4 + -4] and consists of 8 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[arr][j * 4 + arr] + limit and consists of 4 locations. One nondeterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 135 SDtfs, 189 SDslu, 106 SDs, 0 SdLazy, 201 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf97 lsp94 ukn75 mio100 lsp55 div100 bol100 ite100 ukn100 eq159 hnf91 smp91 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms 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...