./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array07_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array07_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer --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 77498d00b446eec99f943fd8f68173cd9df2461a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:21:40,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:21:40,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:21:40,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:21:40,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:21:40,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:21:40,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:21:40,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:21:40,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:21:40,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:21:40,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:21:40,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:21:40,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:21:40,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:21:40,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:21:40,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:21:40,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:21:40,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:21:40,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:21:40,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:21:40,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:21:40,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:21:40,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:21:40,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:21:40,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:21:40,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:21:40,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:21:40,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:21:40,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:21:40,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:21:40,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:21:40,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:21:40,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:21:40,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:21:40,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:21:40,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:21:40,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:21:40,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:21:40,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:21:40,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:21:40,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:21:40,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:21:40,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:21:40,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:21:40,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:21:40,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:21:40,603 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:21:40,603 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:21:40,603 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:21:40,604 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:21:40,604 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:21:40,604 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:21:40,604 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:21:40,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:21:40,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:21:40,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:21:40,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:21:40,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:21:40,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:21:40,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:21:40,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:21:40,607 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:21:40,607 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:21:40,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:21:40,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:21:40,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:21:40,608 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:21:40,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:21:40,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:21:40,609 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:21:40,610 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:21:40,610 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer 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 -> 77498d00b446eec99f943fd8f68173cd9df2461a [2019-11-16 00:21:40,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:21:40,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:21:40,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:21:40,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:21:40,659 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:21:40,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/../../sv-benchmarks/c/termination-15/array07_alloca.i [2019-11-16 00:21:40,737 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/data/e94df7961/be4e1c4310604e4ca881eb10b130e4aa/FLAG08e0484b5 [2019-11-16 00:21:41,302 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:21:41,303 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/sv-benchmarks/c/termination-15/array07_alloca.i [2019-11-16 00:21:41,317 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/data/e94df7961/be4e1c4310604e4ca881eb10b130e4aa/FLAG08e0484b5 [2019-11-16 00:21:41,581 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/data/e94df7961/be4e1c4310604e4ca881eb10b130e4aa [2019-11-16 00:21:41,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:21:41,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:21:41,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:41,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:21:41,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:21:41,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:41" (1/1) ... [2019-11-16 00:21:41,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aefa56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:41, skipping insertion in model container [2019-11-16 00:21:41,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:41" (1/1) ... [2019-11-16 00:21:41,602 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:21:41,646 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:21:42,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:42,155 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:21:42,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:42,304 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:21:42,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42 WrapperNode [2019-11-16 00:21:42,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:42,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:42,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:21:42,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:21:42,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:42,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:21:42,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:21:42,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:21:42,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:21:42,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:21:42,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:21:42,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:21:42,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8df752a9-667f-4218-9622-80b071bea4c7/bin/uautomizer/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 [2019-11-16 00:21:42,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:21:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:21:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:21:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:21:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:21:42,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:21:42,800 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:21:42,800 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-16 00:21:42,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:42 BoogieIcfgContainer [2019-11-16 00:21:42,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:21:42,803 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:21:42,803 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:21:42,807 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:21:42,807 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:21:42,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:21:41" (1/3) ... [2019-11-16 00:21:42,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df9155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:21:42, skipping insertion in model container [2019-11-16 00:21:42,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:21:42,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (2/3) ... [2019-11-16 00:21:42,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df9155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:21:42, skipping insertion in model container [2019-11-16 00:21:42,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:21:42,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:42" (3/3) ... [2019-11-16 00:21:42,812 INFO L371 chiAutomizerObserver]: Analyzing ICFG array07_alloca.i [2019-11-16 00:21:42,880 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:21:42,881 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:21:42,882 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:21:42,882 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:21:42,883 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:21:42,883 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:21:42,883 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:21:42,883 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:21:42,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:21:42,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-16 00:21:42,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:42,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:42,939 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:21:42,939 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:21:42,939 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:21:42,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:21:42,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-16 00:21:42,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:42,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:42,943 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:21:42,943 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:21:42,954 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2019-11-16 00:21:42,955 INFO L793 eck$LassoCheckResult]: Loop: 15#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2019-11-16 00:21:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-16 00:21:42,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:42,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35273828] [2019-11-16 00:21:42,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:42,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:42,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:43,111 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-11-16 00:21:43,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:43,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360592247] [2019-11-16 00:21:43,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:43,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:43,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:43,135 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:43,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-11-16 00:21:43,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:43,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878135702] [2019-11-16 00:21:43,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:43,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:43,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:43,186 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:43,473 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-16 00:21:43,606 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-16 00:21:43,617 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:21:43,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:21:43,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:21:43,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:21:43,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:21:43,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:43,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:21:43,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:21:43,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca.i_Iteration1_Lasso [2019-11-16 00:21:43,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:21:43,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:21:43,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,803 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-16 00:21:43,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:43,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,200 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:21:44,206 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:21:44,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 [2019-11-16 00:21:44,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:44,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:44,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:44,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:44,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:44,215 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:44,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:44,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:44,220 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 [2019-11-16 00:21:44,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:44,221 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:44,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:44,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:44,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:44,222 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:44,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:44,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:44,225 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 [2019-11-16 00:21:44,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:44,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:44,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:44,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:44,237 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:44,238 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:44,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:44,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 [2019-11-16 00:21:44,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:44,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:44,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:44,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:44,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:44,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:44,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:44,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:44,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 [2019-11-16 00:21:44,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:44,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:44,266 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:44,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:44,274 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:44,274 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:44,480 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:21:44,526 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:21:44,526 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:21:44,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:21:44,544 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:21:44,545 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:21:44,545 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-11-16 00:21:44,561 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:21:44,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:21:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:44,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:21:44,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:44,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:21:44,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:44,713 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 [2019-11-16 00:21:44,715 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-16 00:21:44,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2019-11-16 00:21:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:21:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:21:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-16 00:21:44,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:21:44,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:21:44,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:21:44,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:21:44,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:21:44,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:21:44,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-16 00:21:44,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:21:44,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-11-16 00:21:44,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:21:44,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:21:44,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-16 00:21:44,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:44,825 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:21:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-16 00:21:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:21:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:21:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-16 00:21:44,860 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:21:44,860 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:21:44,860 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:21:44,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-16 00:21:44,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:21:44,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:44,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:44,862 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:44,862 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:21:44,862 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2019-11-16 00:21:44,863 INFO L793 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 103#L374-2 [2019-11-16 00:21:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-11-16 00:21:44,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:44,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724215349] [2019-11-16 00:21:44,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:44,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724215349] [2019-11-16 00:21:44,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:44,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:21:44,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043187403] [2019-11-16 00:21:44,932 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:21:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-11-16 00:21:44,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:44,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483714684] [2019-11-16 00:21:44,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:44,953 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:45,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:45,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:21:45,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:21:45,040 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-16 00:21:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:45,082 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-16 00:21:45,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:21:45,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-16 00:21:45,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:21:45,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-16 00:21:45,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:21:45,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:21:45,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-16 00:21:45,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:45,087 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-16 00:21:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-16 00:21:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-16 00:21:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:21:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-16 00:21:45,089 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-16 00:21:45,090 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-16 00:21:45,090 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:21:45,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-16 00:21:45,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:21:45,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:45,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:45,092 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:45,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:21:45,092 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2019-11-16 00:21:45,092 INFO L793 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 131#L374-2 [2019-11-16 00:21:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:45,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-11-16 00:21:45,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:45,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044887628] [2019-11-16 00:21:45,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:45,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:45,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:45,121 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-11-16 00:21:45,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:45,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046248534] [2019-11-16 00:21:45,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:45,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:45,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:45,140 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-11-16 00:21:45,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:45,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252480007] [2019-11-16 00:21:45,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:45,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:45,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:45,210 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:45,482 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-16 00:21:45,567 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:21:45,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:21:45,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:21:45,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:21:45,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:21:45,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:45,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:21:45,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:21:45,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca.i_Iteration3_Lasso [2019-11-16 00:21:45,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:21:45,569 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:21:45,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,743 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-16 00:21:45,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:46,129 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:21:46,129 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:21:46,130 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 [2019-11-16 00:21:46,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,131 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,132 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,132 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,133 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 [2019-11-16 00:21:46,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,134 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,134 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,137 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 [2019-11-16 00:21:46,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:46,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,158 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 [2019-11-16 00:21:46,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,160 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,160 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,162 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 [2019-11-16 00:21:46,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,165 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:46,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,174 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 [2019-11-16 00:21:46,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,181 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,181 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:46,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,235 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 [2019-11-16 00:21:46,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,236 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:21:46,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,256 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:46,256 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:46,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,267 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 [2019-11-16 00:21:46,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,276 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,276 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:46,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,292 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 [2019-11-16 00:21:46,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,294 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,296 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 [2019-11-16 00:21:46,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,296 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,297 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,299 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 [2019-11-16 00:21:46,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,302 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,302 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:21:46,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,305 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 [2019-11-16 00:21:46,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,308 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-16 00:21:46,309 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 [2019-11-16 00:21:46,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,310 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,311 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,313 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 [2019-11-16 00:21:46,313 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,314 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,315 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,318 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 [2019-11-16 00:21:46,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,319 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,321 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:21:46,321 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-16 00:21:46,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,324 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 [2019-11-16 00:21:46,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,326 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,326 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,327 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,328 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 [2019-11-16 00:21:46,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,329 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,331 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:21:46,331 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-16 00:21:46,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,334 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 [2019-11-16 00:21:46,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,336 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,341 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:21:46,342 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-16 00:21:46,432 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:21:46,534 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:21:46,534 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:21:46,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:21:46,537 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2019-11-16 00:21:46,537 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:21:46,537 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-16 00:21:46,552 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:21:46,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:21:46,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:21:46,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:21:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:46,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:21:46,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:46,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:21:46,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:46,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:21:46,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-16 00:21:46,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2019-11-16 00:21:46,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-16 00:21:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-16 00:21:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2019-11-16 00:21:46,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2019-11-16 00:21:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:21:46,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2019-11-16 00:21:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:21:46,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:21:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:21:46,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-16 00:21:46,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:21:46,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-11-16 00:21:46,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:21:46,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:21:46,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:21:46,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:46,661 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:21:46,661 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:21:46,661 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:21:46,661 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:21:46,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:21:46,662 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:21:46,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:21:46,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:21:46 BoogieIcfgContainer [2019-11-16 00:21:46,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:21:46,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:21:46,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:21:46,672 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:21:46,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:42" (3/4) ... [2019-11-16 00:21:46,677 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:21:46,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:21:46,680 INFO L168 Benchmark]: Toolchain (without parser) took 5094.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -262.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:21:46,682 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:21:46,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:46,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.04 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:46,687 INFO L168 Benchmark]: Boogie Preprocessor took 29.51 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. [2019-11-16 00:21:46,688 INFO L168 Benchmark]: RCFGBuilder took 414.83 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: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:46,690 INFO L168 Benchmark]: BuchiAutomizer took 3868.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:21:46,691 INFO L168 Benchmark]: Witness Printer took 5.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:21:46,702 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 719.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.04 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 414.83 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: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3868.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 #length - 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 2 * unknown-#memory_int-unknown[arr][arr] + 1 else -2 * j + 2 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 33 SDslu, 12 SDs, 0 SdLazy, 23 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital112 mio100 ax100 hnf99 lsp94 ukn79 mio100 lsp66 div100 bol100 ite100 ukn100 eq169 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 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...