./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/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 32bit --witnessprinter.graph.data.programhash fa1df4216228ace3c3c1088507575f9600e9db06 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12:10,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:10,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:10,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:10,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:10,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:10,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:10,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:10,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:10,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:10,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:10,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:10,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:10,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:10,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:10,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:10,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:10,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:10,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:10,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:10,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:10,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:10,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:10,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:10,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:10,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:10,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:10,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:10,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:10,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:10,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:10,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:10,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:10,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:10,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:10,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:10,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:10,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:10,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:10,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:10,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:10,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:12:10,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:10,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:10,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:10,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:10,586 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:10,586 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:12:10,586 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:12:10,586 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:12:10,587 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:12:10,587 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:12:10,587 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:12:10,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:10,588 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:12:10,588 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:12:10,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:12:10,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:12:10,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:10,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:12:10,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:12:10,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:12:10,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:12:10,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:12:10,591 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:12:10,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:10,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:12:10,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:10,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:10,592 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:12:10,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:10,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:12:10,594 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:12:10,594 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:12:10,597 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_276d6653-8fd8-415f-8891-5b070dcfa7eb/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa1df4216228ace3c3c1088507575f9600e9db06 [2019-11-16 00:12:10,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:10,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:10,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:10,643 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:10,643 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:10,644 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2019-11-16 00:12:10,695 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/data/18efd41da/1c571d4a5d69472881b24215eb502f67/FLAGd835aa03f [2019-11-16 00:12:11,216 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:11,217 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2019-11-16 00:12:11,235 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/data/18efd41da/1c571d4a5d69472881b24215eb502f67/FLAGd835aa03f [2019-11-16 00:12:11,714 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/data/18efd41da/1c571d4a5d69472881b24215eb502f67 [2019-11-16 00:12:11,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:11,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:12:11,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:11,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:11,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:11,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:11" (1/1) ... [2019-11-16 00:12:11,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c02b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:11, skipping insertion in model container [2019-11-16 00:12:11,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:11" (1/1) ... [2019-11-16 00:12:11,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:11,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:12,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:12,173 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:12,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:12,288 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:12,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12 WrapperNode [2019-11-16 00:12:12,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:12,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:12,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:12:12,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:12:12,298 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:12:12" (1/1) ... [2019-11-16 00:12:12,311 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:12:12" (1/1) ... [2019-11-16 00:12:12,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:12,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:12,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:12,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:12,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... [2019-11-16 00:12:12,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... [2019-11-16 00:12:12,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... [2019-11-16 00:12:12,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... [2019-11-16 00:12:12,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... [2019-11-16 00:12:12,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... [2019-11-16 00:12:12,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... [2019-11-16 00:12:12,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:12,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:12,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:12,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:12,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/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:12:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:12:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:12:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:12:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:12:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:12,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:12,680 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:12,680 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:12:12,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:12 BoogieIcfgContainer [2019-11-16 00:12:12,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:12,681 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:12:12,681 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:12:12,684 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:12:12,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:12,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:12:11" (1/3) ... [2019-11-16 00:12:12,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a2c870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:12:12, skipping insertion in model container [2019-11-16 00:12:12,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:12,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:12" (2/3) ... [2019-11-16 00:12:12,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a2c870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:12:12, skipping insertion in model container [2019-11-16 00:12:12,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:12,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:12" (3/3) ... [2019-11-16 00:12:12,689 INFO L371 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-1.i [2019-11-16 00:12:12,730 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:12:12,731 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:12:12,731 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:12:12,731 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:12,731 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:12,731 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:12:12,732 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:12,732 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:12:12,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:12:12,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:12:12,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:12,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:12,771 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:12:12,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:12,772 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:12:12,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:12:12,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:12:12,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:12,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:12,774 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:12:12,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:12,782 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 14#L529true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 18#L529-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 10#L534-3true [2019-11-16 00:12:12,782 INFO L793 eck$LassoCheckResult]: Loop: 10#L534-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 8#L534-2true main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 10#L534-3true [2019-11-16 00:12:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-16 00:12:12,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:12,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476257225] [2019-11-16 00:12:12,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:12,903 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-16 00:12:12,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:12,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678755225] [2019-11-16 00:12:12,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:12,923 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-16 00:12:12,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:12,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013322098] [2019-11-16 00:12:12,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:12,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:12,970 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:13,171 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:13,172 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:13,172 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:13,172 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:13,172 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:13,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:13,173 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:13,173 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:13,173 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration1_Lasso [2019-11-16 00:12:13,173 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:13,174 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:13,197 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:12:13,203 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:12:13,332 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:12:13,335 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:12:13,338 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:12:13,341 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:12:13,345 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:12:13,349 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:12:13,354 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:12:13,358 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:12:13,670 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:13,676 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:13,678 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:12:13,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:13,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:13,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:13,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:13,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:13,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:13,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:13,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:13,698 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:12:13,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:13,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:13,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:13,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:13,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:13,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:13,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:13,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:13,707 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:12:13,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:13,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:13,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:13,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:13,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:13,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:13,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:13,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:13,721 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:12:13,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:13,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:13,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:13,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:13,729 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:13,730 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:13,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:13,742 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:12:13,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:13,744 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:12:13,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:13,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:13,749 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:12:13,750 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:13,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:13,771 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:12:13,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:13,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:13,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:13,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:13,775 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:13,775 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:13,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:13,789 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:12:13,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:13,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:13,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:13,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:13,796 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:13,796 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:13,848 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:13,887 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:12:13,887 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:12:13,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:13,890 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:12:13,891 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:13,892 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-11-16 00:12:13,900 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:12:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:13,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:12:13,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:13,971 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:12:13,987 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:12:13,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-16 00:12:14,043 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-11-16 00:12:14,046 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:12:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-16 00:12:14,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:12:14,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:14,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:12:14,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:14,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:12:14,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:14,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-11-16 00:12:14,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:12:14,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2019-11-16 00:12:14,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:12:14,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:12:14,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-16 00:12:14,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:12:14,070 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-16 00:12:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-16 00:12:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-16 00:12:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:12:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-16 00:12:14,098 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-16 00:12:14,099 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-16 00:12:14,099 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:12:14,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-16 00:12:14,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:12:14,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:14,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:14,102 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:12:14,102 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:12:14,102 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 114#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 122#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 115#L534-3 assume !(main_~i~1 < main_~array_size~0); 116#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 118#L517-3 [2019-11-16 00:12:14,102 INFO L793 eck$LassoCheckResult]: Loop: 118#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 120#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 121#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 117#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 118#L517-3 [2019-11-16 00:12:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-16 00:12:14,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945179885] [2019-11-16 00:12:14,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:14,199 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:12:14,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945179885] [2019-11-16 00:12:14,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:14,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:12:14,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108235544] [2019-11-16 00:12:14,202 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:12:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2019-11-16 00:12:14,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869550597] [2019-11-16 00:12:14,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:14,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:14,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:12:14,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:12:14,294 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-16 00:12:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:14,323 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-16 00:12:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:12:14,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-16 00:12:14,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:12:14,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2019-11-16 00:12:14,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:12:14,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:12:14,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-16 00:12:14,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:12:14,326 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-16 00:12:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-16 00:12:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-16 00:12:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:12:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-16 00:12:14,328 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-16 00:12:14,328 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-16 00:12:14,328 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:12:14,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-16 00:12:14,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:12:14,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:14,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:14,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:14,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:12:14,330 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 144#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 154#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 148#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 145#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 146#L534-3 assume !(main_~i~1 < main_~array_size~0); 149#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 151#L517-3 [2019-11-16 00:12:14,330 INFO L793 eck$LassoCheckResult]: Loop: 151#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 152#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 153#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 150#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 151#L517-3 [2019-11-16 00:12:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-16 00:12:14,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061840103] [2019-11-16 00:12:14,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,353 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2019-11-16 00:12:14,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111724241] [2019-11-16 00:12:14,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,363 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:14,364 INFO L82 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2019-11-16 00:12:14,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:14,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762580728] [2019-11-16 00:12:14,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:14,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:14,418 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:14,680 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-16 00:12:14,767 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:14,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:14,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:14,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:14,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:14,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:14,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:14,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:14,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration3_Lasso [2019-11-16 00:12:14,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:14,769 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:14,774 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:12:14,781 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:12:14,784 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:12:14,787 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:12:14,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:12:14,791 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:12:14,795 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:12:14,797 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:12:14,799 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:12:14,802 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:12:14,805 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:12:14,808 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:12:14,810 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:12:14,812 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:12:14,815 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:12:14,818 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:12:14,821 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:12:14,823 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:12:15,245 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:15,245 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:15,246 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:12:15,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,248 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,248 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,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:12:15,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,250 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:15,250 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,252 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:12:15,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,254 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:15,254 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,257 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:12:15,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,259 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:12:15,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,260 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,261 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,261 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:12:15,262 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,263 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:15,263 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,265 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:12:15,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,266 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,266 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,267 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,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:12:15,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,270 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:12:15,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,271 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,272 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:12:15,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,274 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:15,274 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,276 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:12:15,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,279 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:12:15,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,281 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:12:15,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,281 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,282 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,282 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,283 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:12:15,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,284 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,285 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:12:15,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,287 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:15,287 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,289 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:12:15,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,291 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:15,291 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,294 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:12:15,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,294 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,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:12:15,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:15,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:15,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:15,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,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:12:15,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,310 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:12:15,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,314 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:12:15,316 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:15,337 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:12:15,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:15,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:15,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:15,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:15,347 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:15,347 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:15,402 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:15,444 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:12:15,444 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:12:15,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:15,446 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:12:15,447 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:15,447 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2019-11-16 00:12:15,449 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-16 00:12:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:15,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:15,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:15,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:12:15,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:15,504 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:12:15,505 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:12:15,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:12:15,518 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 4 states. [2019-11-16 00:12:15,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-16 00:12:15,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:12:15,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:15,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-16 00:12:15,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:15,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-16 00:12:15,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:15,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-11-16 00:12:15,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:15,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2019-11-16 00:12:15,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:12:15,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:12:15,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-16 00:12:15,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:12:15,523 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-16 00:12:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-16 00:12:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-16 00:12:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:12:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-16 00:12:15,525 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:12:15,525 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:12:15,525 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:12:15,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-16 00:12:15,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:15,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:15,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:15,526 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:15,526 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:15,526 INFO L791 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 233#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 246#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 239#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 234#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 235#L534-3 assume !(main_~i~1 < main_~array_size~0); 240#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 241#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 243#L520-3 [2019-11-16 00:12:15,526 INFO L793 eck$LassoCheckResult]: Loop: 243#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 244#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 243#L520-3 [2019-11-16 00:12:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-11-16 00:12:15,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:15,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326647742] [2019-11-16 00:12:15,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:15,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2019-11-16 00:12:15,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:15,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406719509] [2019-11-16 00:12:15,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:15,563 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2019-11-16 00:12:15,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:15,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956221481] [2019-11-16 00:12:15,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:15,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:15,606 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:15,854 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-11-16 00:12:15,934 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:15,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:15,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:15,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:15,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:15,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:15,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:15,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:15,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration4_Lasso [2019-11-16 00:12:15,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:15,935 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:15,939 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:12:15,941 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:12:15,948 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:12:15,950 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:12:15,952 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:12:15,954 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:12:15,956 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:12:15,959 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:12:15,961 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:12:15,963 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:12:15,966 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:12:15,968 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:12:15,984 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:12:15,987 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:12:15,990 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:12:15,994 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:12:15,998 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:12:16,000 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:12:16,171 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-16 00:12:16,625 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:16,626 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:16,626 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:12:16,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,628 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:12:16,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,630 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:16,630 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,632 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:12:16,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,633 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,633 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,634 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:12:16,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,636 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:12:16,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,638 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:12:16,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,640 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:12:16,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,641 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:16,641 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,643 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:12:16,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,644 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:16,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,647 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:12:16,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,649 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:16,649 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,651 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:12:16,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,653 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:12:16,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:16,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,659 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:12:16,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:16,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,662 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:12:16,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,662 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,663 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,664 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:12:16,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,666 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:12:16,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,668 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:16,668 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,670 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:12:16,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,672 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:12:16,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,674 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:16,674 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,678 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:12:16,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,679 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:12:16,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,681 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:12:16,681 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:16,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:16,688 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:12:16,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:16,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:16,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:16,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:16,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:16,690 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:16,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:16,691 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:16,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:12:16,692 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:12:16,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:16,693 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:12:16,693 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:16,693 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2019-11-16 00:12:16,708 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-16 00:12:16,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:12:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:16,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:16,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:16,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:12:16,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:16,757 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:12:16,757 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:12:16,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:12:16,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 34 transitions. Complement of second has 7 states. [2019-11-16 00:12:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-16 00:12:16,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:12:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:16,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:12:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:16,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:12:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:16,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-11-16 00:12:16,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:16,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 26 transitions. [2019-11-16 00:12:16,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:12:16,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:12:16,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-16 00:12:16,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:12:16,780 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-16 00:12:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-16 00:12:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-11-16 00:12:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:12:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-16 00:12:16,782 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-16 00:12:16,782 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-16 00:12:16,782 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:12:16,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-16 00:12:16,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:16,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:16,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:16,783 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:16,784 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:16,784 INFO L791 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 351#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 365#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 357#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 352#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 353#L534-3 assume !(main_~i~1 < main_~array_size~0); 358#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 359#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 360#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 367#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 354#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 355#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 362#L520-3 [2019-11-16 00:12:16,784 INFO L793 eck$LassoCheckResult]: Loop: 362#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 363#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 362#L520-3 [2019-11-16 00:12:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2019-11-16 00:12:16,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:16,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067948314] [2019-11-16 00:12:16,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:16,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:16,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:16,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067948314] [2019-11-16 00:12:16,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953938039] [2019-11-16 00:12:16,873 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_276d6653-8fd8-415f-8891-5b070dcfa7eb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:16,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:12:16,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:12:16,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:12:16,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:17,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:12:17,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-16 00:12:17,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610504175] [2019-11-16 00:12:17,039 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:12:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2019-11-16 00:12:17,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:17,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279000340] [2019-11-16 00:12:17,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,050 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:17,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:17,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:12:17,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:12:17,086 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 14 states. [2019-11-16 00:12:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:17,345 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-11-16 00:12:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:12:17,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-11-16 00:12:17,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:17,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 25 transitions. [2019-11-16 00:12:17,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:12:17,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:12:17,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-11-16 00:12:17,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:12:17,351 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-16 00:12:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-11-16 00:12:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-16 00:12:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:12:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-16 00:12:17,353 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-16 00:12:17,353 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-16 00:12:17,353 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:12:17,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-11-16 00:12:17,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:17,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:17,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:17,355 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:17,355 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:17,355 INFO L791 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 463#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 464#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 479#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 470#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 465#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 466#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 471#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 482#L534-3 assume !(main_~i~1 < main_~array_size~0); 476#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 472#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 473#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 481#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 468#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 469#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 475#L520-3 [2019-11-16 00:12:17,356 INFO L793 eck$LassoCheckResult]: Loop: 475#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 477#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 475#L520-3 [2019-11-16 00:12:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2019-11-16 00:12:17,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:17,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719163286] [2019-11-16 00:12:17,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,380 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2019-11-16 00:12:17,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:17,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988189340] [2019-11-16 00:12:17,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,390 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2019-11-16 00:12:17,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:17,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436439346] [2019-11-16 00:12:17,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:17,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:17,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:17,796 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2019-11-16 00:12:17,869 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:17,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:17,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:17,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:17,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:17,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:17,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:17,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:17,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration6_Lasso [2019-11-16 00:12:17,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:17,870 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:17,873 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:12:18,014 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-16 00:12:18,033 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:12:18,035 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:12:18,037 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:12:18,039 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:12:18,041 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:12:18,043 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:12:18,045 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:12:18,047 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:12:18,052 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:12:18,054 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:12:18,055 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:12:18,057 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:12:18,059 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:12:18,060 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:12:18,062 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:12:18,064 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:12:18,065 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:12:18,461 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:18,461 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:18,461 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:12:18,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:18,462 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:12:18,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:18,462 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:18,464 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:12:18,464 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:18,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:18,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:18,472 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:18,472 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:18,472 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:18,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:18,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:18,473 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:18,473 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:18,474 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:18,475 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:12:18,475 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:12:18,476 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:18,476 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:12:18,476 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:18,476 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2019-11-16 00:12:18,510 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-16 00:12:18,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:12:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:18,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:12:18,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:18,614 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:12:18,614 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:12:18,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:12:18,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 31 transitions. Complement of second has 7 states. [2019-11-16 00:12:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-16 00:12:18,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-16 00:12:18,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:18,639 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:12:18,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:18,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:12:18,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:18,692 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:12:18,693 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 [2019-11-16 00:12:18,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:12:18,707 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 31 transitions. Complement of second has 7 states. [2019-11-16 00:12:18,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-16 00:12:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-16 00:12:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:18,710 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:12:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:18,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:18,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:12:18,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:18,768 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:12:18,768 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 [2019-11-16 00:12:18,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:12:18,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 27 states and 33 transitions. Complement of second has 6 states. [2019-11-16 00:12:18,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-16 00:12:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-16 00:12:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-16 00:12:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-16 00:12:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:18,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2019-11-16 00:12:18,789 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:12:18,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-11-16 00:12:18,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:12:18,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:12:18,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:12:18,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:12:18,789 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:18,789 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:18,789 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:18,790 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:12:18,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:12:18,790 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:12:18,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:12:18,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:12:18 BoogieIcfgContainer [2019-11-16 00:12:18,798 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:12:18,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:12:18,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:12:18,799 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:12:18,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:12" (3/4) ... [2019-11-16 00:12:18,802 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:12:18,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:12:18,803 INFO L168 Benchmark]: Toolchain (without parser) took 7086.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -207.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:18,803 INFO L168 Benchmark]: CDTParser took 0.21 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:12:18,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:18,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.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. [2019-11-16 00:12:18,805 INFO L168 Benchmark]: Boogie Preprocessor took 25.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:18,806 INFO L168 Benchmark]: RCFGBuilder took 325.25 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:18,806 INFO L168 Benchmark]: BuchiAutomizer took 6116.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.5 MB). Peak memory consumption was 212.8 kB. Max. memory is 11.5 GB. [2019-11-16 00:12:18,807 INFO L168 Benchmark]: Witness Printer took 3.24 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:12:18,810 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.21 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 572.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.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 25.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.25 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6116.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.5 MB). Peak memory consumption was 212.8 kB. Max. memory is 11.5 GB. * Witness Printer took 3.24 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. * 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + array_size and consists of 5 locations. One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 90 SDtfs, 121 SDslu, 100 SDs, 0 SdLazy, 142 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital141 mio100 ax113 hnf99 lsp81 ukn78 mio100 lsp58 div100 bol100 ite100 ukn100 eq183 hnf90 smp96 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...