./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/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 653582a7b000e4f324410c98077c6ee21baa5247 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:59,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:59,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:59,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:59,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:59,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:59,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:59,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:59,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:59,081 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:59,082 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:59,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:59,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:59,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:59,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:59,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:59,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:59,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:59,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:59,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:59,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:59,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:59,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:59,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:59,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:59,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:59,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:59,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:59,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:59,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:59,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:59,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:59,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:59,111 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:59,112 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:59,113 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:59,113 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:07:59,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:59,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:59,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:59,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:59,126 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:59,126 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:59,126 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:59,126 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:59,127 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:59,127 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:59,127 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:59,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:59,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:07:59,127 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:59,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:59,128 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:07:59,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:59,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:59,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:59,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:59,130 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:07:59,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:59,130 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:59,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:59,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:59,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:59,131 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:59,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:59,132 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:59,132 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:59,133 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:59,133 INFO L133 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/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/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 -> 653582a7b000e4f324410c98077c6ee21baa5247 [2018-10-27 06:07:59,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:59,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:59,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:59,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:59,178 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:59,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:07:59,218 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/data/3d21af147/5ef53bd88b144ad2adf449fad106ecbb/FLAG193bf363c [2018-10-27 06:07:59,681 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:59,682 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/sv-benchmarks/c/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:07:59,690 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/data/3d21af147/5ef53bd88b144ad2adf449fad106ecbb/FLAG193bf363c [2018-10-27 06:07:59,703 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/uautomizer/data/3d21af147/5ef53bd88b144ad2adf449fad106ecbb [2018-10-27 06:07:59,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:59,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:59,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:59,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:59,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:59,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:59" (1/1) ... [2018-10-27 06:07:59,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef510a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:59, skipping insertion in model container [2018-10-27 06:07:59,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:59" (1/1) ... [2018-10-27 06:07:59,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:59,764 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:59,975 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:59,984 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:00,018 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:00,052 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:00,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00 WrapperNode [2018-10-27 06:08:00,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:00,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:00,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:00,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:00,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:00,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:00,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:00,163 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:00,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... [2018-10-27 06:08:00,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:00,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:00,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:00,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:00,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e754f236-3df7-46eb-9523-c8b4ca43ad28/bin-2019/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 [2018-10-27 06:08:00,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:00,673 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:00,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:00 BoogieIcfgContainer [2018-10-27 06:08:00,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:00,674 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:00,674 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:00,678 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:00,678 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:00,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:59" (1/3) ... [2018-10-27 06:08:00,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ba99c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:00, skipping insertion in model container [2018-10-27 06:08:00,680 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:00,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:00" (2/3) ... [2018-10-27 06:08:00,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ba99c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:00, skipping insertion in model container [2018-10-27 06:08:00,680 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:00,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:00" (3/3) ... [2018-10-27 06:08:00,682 INFO L375 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:08:00,732 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:00,733 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:00,733 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:00,733 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:00,733 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:00,733 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:00,733 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:00,733 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:00,733 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:00,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-10-27 06:08:00,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:00,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:00,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:00,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:00,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:08:00,772 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:00,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-10-27 06:08:00,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:00,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:00,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:00,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:00,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:08:00,781 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L557true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8#L557-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 15#L545-4true [2018-10-27 06:08:00,782 INFO L795 eck$LassoCheckResult]: Loop: 15#L545-4true assume true; 9#L545-1true assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 10#L548-4true assume !true; 13#L545-3true sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := sumOfThirdBytes_#t~post2 + 1;havoc sumOfThirdBytes_#t~post2; 15#L545-4true [2018-10-27 06:08:00,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-10-27 06:08:00,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1329224, now seen corresponding path program 1 times [2018-10-27 06:08:00,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:00,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:00,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:00,923 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:08:00,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:08:00,938 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-10-27 06:08:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:00,944 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-10-27 06:08:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:08:00,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-10-27 06:08:00,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:00,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2018-10-27 06:08:00,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:08:00,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-10-27 06:08:00,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-10-27 06:08:00,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:00,953 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-27 06:08:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-10-27 06:08:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-27 06:08:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-27 06:08:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-27 06:08:00,979 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-27 06:08:00,979 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-27 06:08:00,979 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:00,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-10-27 06:08:00,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:08:00,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:00,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:00,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:08:00,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:00,981 INFO L793 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 51#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 52#L557-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 55#L545-4 [2018-10-27 06:08:00,981 INFO L795 eck$LassoCheckResult]: Loop: 55#L545-4 assume true; 56#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 50#L548-4 assume true; 48#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 49#L548-2 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 53#L545-3 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := sumOfThirdBytes_#t~post2 + 1;havoc sumOfThirdBytes_#t~post2; 55#L545-4 [2018-10-27 06:08:00,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-10-27 06:08:00,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1276985362, now seen corresponding path program 1 times [2018-10-27 06:08:01,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:01,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:01,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:01,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:01,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2015042314, now seen corresponding path program 1 times [2018-10-27 06:08:01,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:01,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:01,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:01,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:01,176 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:08:01,404 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-27 06:08:01,574 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-27 06:08:01,594 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:01,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:01,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:01,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:01,595 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:01,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:01,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:01,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:01,597 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-10-27 06:08:01,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:01,597 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:01,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:02,336 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:08:02,673 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:02,678 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:02,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:02,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:02,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:02,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:02,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:02,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:02,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:02,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:02,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:02,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:02,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:02,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:02,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:02,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:02,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:02,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:02,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:02,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:02,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:02,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:02,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:02,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:02,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:02,851 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:02,938 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:08:02,938 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-10-27 06:08:02,940 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:02,942 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:02,942 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:02,943 INFO L519 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 [] [2018-10-27 06:08:02,976 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:08:03,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:03,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:03,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:03,067 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 [2018-10-27 06:08:03,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-10-27 06:08:03,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 24 states and 28 transitions. Complement of second has 6 states. [2018-10-27 06:08:03,112 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 [2018-10-27 06:08:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-10-27 06:08:03,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. [2018-10-27 06:08:03,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:03,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 6 letters. [2018-10-27 06:08:03,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:03,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 12 letters. [2018-10-27 06:08:03,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:03,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-10-27 06:08:03,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:03,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 27 transitions. [2018-10-27 06:08:03,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-10-27 06:08:03,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-10-27 06:08:03,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:08:03,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:03,119 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:08:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:08:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:08:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:08:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:08:03,121 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:08:03,122 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:08:03,122 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:03,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:08:03,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:03,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:03,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:03,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:03,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:03,123 INFO L793 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 151#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 152#L557-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 156#L545-4 assume true; 157#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 145#L548-4 [2018-10-27 06:08:03,123 INFO L795 eck$LassoCheckResult]: Loop: 145#L548-4 assume true; 147#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 148#L548-2 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := sumOfThirdBytes_#t~post4 + 1;havoc sumOfThirdBytes_#t~post4; 153#L550 SUMMARY for call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550 162#L550-1 sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5; 141#L550-2 SUMMARY for call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550-2 142#L550-3 havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 145#L548-4 [2018-10-27 06:08:03,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-10-27 06:08:03,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:03,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 1 times [2018-10-27 06:08:03,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:03,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 633989139, now seen corresponding path program 1 times [2018-10-27 06:08:03,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:03,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,281 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:08:03,495 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2018-10-27 06:08:03,617 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-10-27 06:08:03,619 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:03,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:03,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:03,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:03,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:03,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:03,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:03,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:03,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-10-27 06:08:03,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:03,620 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:03,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:03,809 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-10-27 06:08:03,986 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-27 06:08:04,129 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:04,129 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:04,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,169 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:04,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,171 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:04,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:04,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:04,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:04,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:04,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:04,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:04,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:04,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:04,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:04,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:04,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:04,215 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:04,216 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:04,217 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:04,217 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:04,217 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:04,217 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:04,217 INFO L519 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 [] [2018-10-27 06:08:04,290 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:08:04,291 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:04,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:04,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:04,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:04,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:04,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:08:04,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:08:04,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:04,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:04,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:04,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:08:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:04,569 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:04,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-10-27 06:08:04,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 62 states and 70 transitions. Complement of second has 13 states. [2018-10-27 06:08:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-10-27 06:08:04,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 6 letters. Loop has 7 letters. [2018-10-27 06:08:04,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:08:04,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 6 letters. Loop has 14 letters. [2018-10-27 06:08:04,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:04,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2018-10-27 06:08:04,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:04,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 39 states and 45 transitions. [2018-10-27 06:08:04,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:08:04,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-10-27 06:08:04,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2018-10-27 06:08:04,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:04,628 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-10-27 06:08:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2018-10-27 06:08:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-10-27 06:08:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:08:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:08:04,634 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:08:04,634 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:08:04,634 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:04,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:08:04,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:04,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:04,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:04,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,637 INFO L793 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 325#L557 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 326#L557-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~array_size~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;assume { :begin_inline_sumOfThirdBytes } true;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; 329#L545-4 assume true; 336#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 346#L548-4 assume true; 323#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 324#L548-2 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 328#L545-3 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := sumOfThirdBytes_#t~post2 + 1;havoc sumOfThirdBytes_#t~post2; 334#L545-4 assume true; 330#L545-1 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + sumOfThirdBytes_~i~0 * 4;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset + 2; 319#L548-4 [2018-10-27 06:08:04,637 INFO L795 eck$LassoCheckResult]: Loop: 319#L548-4 assume true; 321#L548-1 SUMMARY for call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L548-1 322#L548-2 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := sumOfThirdBytes_#t~post4 + 1;havoc sumOfThirdBytes_#t~post4; 327#L550 SUMMARY for call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550 337#L550-1 sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5; 315#L550-2 SUMMARY for call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); srcloc: L550-2 316#L550-3 havoc sumOfThirdBytes_#t~mem5;havoc sumOfThirdBytes_#t~post6; 319#L548-4 [2018-10-27 06:08:04,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash 574587163, now seen corresponding path program 2 times [2018-10-27 06:08:04,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash 507861116, now seen corresponding path program 2 times [2018-10-27 06:08:04,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash -878623198, now seen corresponding path program 1 times [2018-10-27 06:08:04,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:04,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,898 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2018-10-27 06:08:04,952 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:04,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:04,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:04,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:04,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:04,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:04,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:04,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:04,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-10-27 06:08:04,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:04,952 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:04,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:04,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,190 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-10-27 06:08:05,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:05,623 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:05,623 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:05,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:05,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:05,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:05,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:05,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:05,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:05,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:05,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:05,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,702 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:05,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,703 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:05,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:05,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:05,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:05,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:05,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:05,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:05,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:05,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:05,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:05,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:05,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:05,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:05,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:05,723 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:05,723 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:05,726 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:05,726 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:08:05,727 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:05,727 INFO L519 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 [] [2018-10-27 06:08:05,786 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-10-27 06:08:05,788 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:05,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:05,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:05,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:05,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:05,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:08:05,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:08:05,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:05,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:08:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:05,916 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:05,916 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:08:05,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 52 states and 60 transitions. Complement of second has 13 states. [2018-10-27 06:08:05,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-10-27 06:08:05,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 12 letters. Loop has 7 letters. [2018-10-27 06:08:05,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:05,973 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:05,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:05,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:06,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:06,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:06,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:08:06,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:08:06,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:06,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:06,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:06,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:08:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:06,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:06,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:08:06,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 51 states and 59 transitions. Complement of second has 15 states. [2018-10-27 06:08:06,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-10-27 06:08:06,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 12 letters. Loop has 7 letters. [2018-10-27 06:08:06,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:06,144 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:06,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:06,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:06,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:06,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:06,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:08:06,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:08:06,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:06,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:06,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:06,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:08:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:06,419 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 6 loop predicates [2018-10-27 06:08:06,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:08:06,464 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 63 states and 73 transitions. Complement of second has 12 states. [2018-10-27 06:08:06,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:08:06,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 12 letters. Loop has 7 letters. [2018-10-27 06:08:06,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:06,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 19 letters. Loop has 7 letters. [2018-10-27 06:08:06,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:06,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 12 letters. Loop has 14 letters. [2018-10-27 06:08:06,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:06,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2018-10-27 06:08:06,470 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:06,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2018-10-27 06:08:06,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:06,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:06,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:06,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:06,470 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:06,470 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:06,471 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:06,471 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:06,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:06,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:06,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:06,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:06 BoogieIcfgContainer [2018-10-27 06:08:06,479 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:06,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:06,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:06,479 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:06,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:00" (3/4) ... [2018-10-27 06:08:06,482 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:06,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:06,483 INFO L168 Benchmark]: Toolchain (without parser) took 6776.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 957.1 MB in the beginning and 989.0 MB in the end (delta: -31.9 MB). Peak memory consumption was 148.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:06,483 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:06,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.32 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:06,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:06,485 INFO L168 Benchmark]: Boogie Preprocessor took 22.24 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:06,486 INFO L168 Benchmark]: RCFGBuilder took 488.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:06,487 INFO L168 Benchmark]: BuchiAutomizer took 5805.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 989.0 MB in the end (delta: 114.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:06,488 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 989.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:06,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.32 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.24 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 488.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5805.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 989.0 MB in the end (delta: 114.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 989.0 MB. 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 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 92 SDtfs, 83 SDslu, 64 SDs, 0 SdLazy, 109 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax100 hnf98 lsp91 ukn92 mio100 lsp53 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 6 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...