./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58d4e5463d025a43f4c9f80bcbe28ceb46ed79b1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:56,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:56,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:56,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:56,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:56,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:56,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:56,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:56,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:56,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:56,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:56,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:56,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:56,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:56,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:56,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:56,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:56,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:56,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:56,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:56,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:56,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:56,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:56,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:56,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:56,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:56,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:56,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:56,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:56,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:56,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:56,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:56,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:56,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:56,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:56,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:56,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:56,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:56,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:56,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:56,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:56,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:56,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:56,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:56,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:56,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:56,293 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:56,293 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:56,293 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:56,293 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:56,293 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:56,293 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:56,294 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:56,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:56,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:56,294 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:56,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:56,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:56,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:56,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:56,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:56,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:56,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:56,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:56,295 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:56,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:56,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:56,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:56,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:56,296 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:56,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:56,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:56,297 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:56,297 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:56,298 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58d4e5463d025a43f4c9f80bcbe28ceb46ed79b1 [2019-10-22 08:59:56,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:56,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:56,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:56,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:56,334 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:56,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2019-10-22 08:59:56,382 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/data/f2e98038c/9dce1fd8b5af460daf9f09a46ce20669/FLAG954f49b77 [2019-10-22 08:59:56,819 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:56,819 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2019-10-22 08:59:56,830 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/data/f2e98038c/9dce1fd8b5af460daf9f09a46ce20669/FLAG954f49b77 [2019-10-22 08:59:56,840 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/data/f2e98038c/9dce1fd8b5af460daf9f09a46ce20669 [2019-10-22 08:59:56,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:56,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:56,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:56,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:56,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:56,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:56" (1/1) ... [2019-10-22 08:59:56,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a6ed0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:56, skipping insertion in model container [2019-10-22 08:59:56,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:56" (1/1) ... [2019-10-22 08:59:56,855 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:56,886 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:57,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:57,185 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:57,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:57,261 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:57,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57 WrapperNode [2019-10-22 08:59:57,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:57,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:57,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:57,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:57,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:57,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:57,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:57,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:57,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... [2019-10-22 08:59:57,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:57,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:57,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:57,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:57,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:57,692 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:57,692 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:59:57,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:57 BoogieIcfgContainer [2019-10-22 08:59:57,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:57,694 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:57,694 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:57,698 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:57,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:57,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:56" (1/3) ... [2019-10-22 08:59:57,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a561ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:57, skipping insertion in model container [2019-10-22 08:59:57,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:57,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:57" (2/3) ... [2019-10-22 08:59:57,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a561ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:57, skipping insertion in model container [2019-10-22 08:59:57,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:57,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:57" (3/3) ... [2019-10-22 08:59:57,704 INFO L371 chiAutomizerObserver]: Analyzing ICFG array02-alloca-2.i [2019-10-22 08:59:57,758 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:57,759 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:57,759 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:57,759 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:57,760 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:57,760 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:57,760 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:57,760 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:57,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:59:57,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:59:57,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:57,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:57,804 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:59:57,804 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:57,804 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:57,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:59:57,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:59:57,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:57,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:57,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:59:57,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:57,814 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 14#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 16#L530-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 10#L535-3true [2019-10-22 08:59:57,814 INFO L793 eck$LassoCheckResult]: Loop: 10#L535-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 7#L535-2true main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 10#L535-3true [2019-10-22 08:59:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:59:57,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703751513] [2019-10-22 08:59:57,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 08:59:57,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612768510] [2019-10-22 08:59:57,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 08:59:57,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023140079] [2019-10-22 08:59:57,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,018 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,170 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:58,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:58,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:58,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:58,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:58,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:58,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:58,172 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:58,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration1_Lasso [2019-10-22 08:59:58,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:58,172 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:58,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,625 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:58,629 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:58,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:58,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:58,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:58,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:58,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:58,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:58,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:58,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:58,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:58,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,648 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,648 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,662 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,662 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,671 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,671 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:58,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,691 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,691 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,756 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:58,818 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:59:58,819 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:58,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:58,822 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:58,823 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:58,823 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-10-22 08:59:58,831 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:58,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:58,915 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:58,916 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-10-22 08:59:58,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 61 transitions. Complement of second has 7 states. [2019-10-22 08:59:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2019-10-22 08:59:58,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:59:58,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:59:58,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:59:58,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 61 transitions. [2019-10-22 08:59:58,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:58,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-10-22 08:59:58,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:58,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:58,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-10-22 08:59:58,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:58,977 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:59:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-10-22 08:59:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:59:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:59:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:59:59,008 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:59:59,008 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:59:59,008 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:59,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:59:59,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:59,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:59,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:59,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:59,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:59,011 INFO L791 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 123#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 124#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 128#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 125#L535-3 assume !(main_~k~0 < main_~array_size~0); 126#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 116#L517-3 [2019-10-22 08:59:59,012 INFO L793 eck$LassoCheckResult]: Loop: 116#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 117#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 118#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 122#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 121#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 115#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 116#L517-3 [2019-10-22 08:59:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 08:59:59,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:59,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030340292] [2019-10-22 08:59:59,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:59,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030340292] [2019-10-22 08:59:59,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:59,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:59,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499421770] [2019-10-22 08:59:59,058 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1809463733, now seen corresponding path program 1 times [2019-10-22 08:59:59,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:59,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160844090] [2019-10-22 08:59:59,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,081 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:59,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:59,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:59,130 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:59:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:59,165 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-10-22 08:59:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:59,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-10-22 08:59:59,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:59,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 08:59:59,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:59,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:59,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-10-22 08:59:59,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:59,168 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:59:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-10-22 08:59:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 08:59:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:59:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-10-22 08:59:59,171 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:59:59,171 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:59:59,171 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:59,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-10-22 08:59:59,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:59,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:59,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:59,172 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:59,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:59,173 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 160#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 164#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 161#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 155#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 156#L535-3 assume !(main_~k~0 < main_~array_size~0); 162#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 154#L517-3 [2019-10-22 08:59:59,173 INFO L793 eck$LassoCheckResult]: Loop: 154#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 151#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 152#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 158#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 157#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 153#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 154#L517-3 [2019-10-22 08:59:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 08:59:59,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:59,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670463779] [2019-10-22 08:59:59,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1809463733, now seen corresponding path program 2 times [2019-10-22 08:59:59,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:59,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994654029] [2019-10-22 08:59:59,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,206 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash -258934749, now seen corresponding path program 1 times [2019-10-22 08:59:59,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:59,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698607711] [2019-10-22 08:59:59,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:59,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:59,235 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:59,464 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-10-22 08:59:59,541 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:59,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:59,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:59,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:59,541 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:59,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:59,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:59,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:59,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration3_Lasso [2019-10-22 08:59:59,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:59,542 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:59,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,725 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 08:59:59,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,093 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:00,094 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:00,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:00,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:00,095 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:00,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:00,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:00,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:00,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:00,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:00,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:00,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:00,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:00,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:00,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:00,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:00,099 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:00,100 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:00,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:00,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:00,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:00,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:00,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:00,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:00,110 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:00,110 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:00,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:00,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:00,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:00,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:00,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:00,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:00,116 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:00,116 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:00,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:00,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:00,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:00,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:00,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:00,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:00,123 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:00,123 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:00,152 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:00,182 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:00,182 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:00,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:00,183 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:00,184 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:00,184 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-10-22 09:00:00,195 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:00:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:00,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:00,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:00,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:00,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:00,243 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:00,243 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 09:00:00,272 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-10-22 09:00:00,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 09:00:00,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 09:00:00,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:00,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2019-10-22 09:00:00,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:00,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 12 letters. [2019-10-22 09:00:00,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:00,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 09:00:00,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:00,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 27 transitions. [2019-10-22 09:00:00,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:00,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:00:00,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-10-22 09:00:00,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:00,275 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-22 09:00:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-10-22 09:00:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 09:00:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:00:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 09:00:00,277 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:00:00,277 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 09:00:00,277 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:00,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-10-22 09:00:00,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:00,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:00,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:00,279 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:00,279 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:00,279 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 277#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 278#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 282#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 279#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 271#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 272#L535-3 assume !(main_~k~0 < main_~array_size~0); 280#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 270#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 264#L518-3 [2019-10-22 09:00:00,279 INFO L793 eck$LassoCheckResult]: Loop: 264#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 265#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 264#L518-3 [2019-10-22 09:00:00,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-10-22 09:00:00,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448482248] [2019-10-22 09:00:00,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,297 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2019-10-22 09:00:00,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193681521] [2019-10-22 09:00:00,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2019-10-22 09:00:00,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482729499] [2019-10-22 09:00:00,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,324 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,516 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-22 09:00:00,578 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:00,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:00,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:00,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:00,579 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:00,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:00,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:00,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:00,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration4_Lasso [2019-10-22 09:00:00,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:00,579 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:00,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,726 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-22 09:00:00,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:00,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,154 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:01,154 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:01,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:01,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:01,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:01,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:01,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:01,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:01,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:01,156 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:01,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:01,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:01,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:01,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:01,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:01,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:01,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:01,162 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:01,162 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:01,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:01,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:01,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:01,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:01,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:01,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:01,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:01,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:01,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:01,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:01,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:01,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:01,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:01,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:01,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:01,166 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:01,166 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:01,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:01,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:01,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:01,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:01,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:01,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:01,171 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:01,171 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:01,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:01,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:01,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:01,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:01,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:01,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:01,187 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:01,187 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:01,194 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:01,197 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:01,197 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:01,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:01,198 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:01,198 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:01,199 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-10-22 09:00:01,211 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:00:01,213 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:01,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:01,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:01,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:01,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:01,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:01,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:00:01,280 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2019-10-22 09:00:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 09:00:01,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:00:01,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:01,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:00:01,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:01,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:00:01,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:01,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-10-22 09:00:01,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:01,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 42 transitions. [2019-10-22 09:00:01,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:00:01,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:01,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2019-10-22 09:00:01,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:01,286 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 09:00:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2019-10-22 09:00:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-22 09:00:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 09:00:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-10-22 09:00:01,288 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-10-22 09:00:01,288 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-10-22 09:00:01,288 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:01,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. [2019-10-22 09:00:01,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:01,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:01,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:01,290 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:01,290 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:01,290 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 416#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 417#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 421#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 418#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 410#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 411#L535-3 assume !(main_~k~0 < main_~array_size~0); 419#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 407#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 402#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 404#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 413#L522-2 [2019-10-22 09:00:01,290 INFO L793 eck$LassoCheckResult]: Loop: 413#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 412#L522 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 413#L522-2 [2019-10-22 09:00:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383699, now seen corresponding path program 1 times [2019-10-22 09:00:01,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:01,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564478706] [2019-10-22 09:00:01,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,317 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:01,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-10-22 09:00:01,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:01,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958395290] [2019-10-22 09:00:01,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762584, now seen corresponding path program 1 times [2019-10-22 09:00:01,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:01,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267469066] [2019-10-22 09:00:01,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,344 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:01,500 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-10-22 09:00:01,550 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:01,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:01,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:01,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:01,550 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:01,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:01,551 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:01,551 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:01,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration5_Lasso [2019-10-22 09:00:01,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:01,551 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:01,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,076 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:02,076 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:02,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,079 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,089 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,090 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,092 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,095 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,098 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,098 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,101 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,102 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,102 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,103 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,112 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:02,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,114 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:02,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,123 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,123 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,134 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,134 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,143 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:02,150 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:02,150 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:00:02,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:02,151 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:02,151 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:02,151 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_3 Supporting invariants [] [2019-10-22 09:00:02,183 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:00:02,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:02,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:02,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:02,222 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:02,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:00:02,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 7 states. [2019-10-22 09:00:02,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 09:00:02,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:00:02,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:02,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 2 letters. [2019-10-22 09:00:02,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:02,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:00:02,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:02,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-10-22 09:00:02,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:02,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 26 states and 34 transitions. [2019-10-22 09:00:02,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:02,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:02,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-10-22 09:00:02,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:02,243 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-22 09:00:02,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-10-22 09:00:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-10-22 09:00:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 09:00:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-22 09:00:02,246 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 09:00:02,246 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 09:00:02,246 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:02,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-10-22 09:00:02,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:02,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:02,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:02,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:02,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:02,248 INFO L791 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 561#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 562#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 568#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 563#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 556#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 557#L535-3 assume !(main_~k~0 < main_~array_size~0); 564#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 554#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 555#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 572#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 571#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 560#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 552#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 553#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 548#L518-3 [2019-10-22 09:00:02,248 INFO L793 eck$LassoCheckResult]: Loop: 548#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 549#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 548#L518-3 [2019-10-22 09:00:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,248 INFO L82 PathProgramCache]: Analyzing trace with hash 562957404, now seen corresponding path program 2 times [2019-10-22 09:00:02,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74095500] [2019-10-22 09:00:02,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:02,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74095500] [2019-10-22 09:00:02,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406180091] [2019-10-22 09:00:02,351 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614ecea5-0b1b-40c3-af6f-56da961d629b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:02,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:02,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:02,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:02,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:02,485 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:02,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-10-22 09:00:02,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420311553] [2019-10-22 09:00:02,486 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2019-10-22 09:00:02,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120186777] [2019-10-22 09:00:02,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,493 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:02,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:00:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:00:02,523 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-10-22 09:00:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:02,668 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-10-22 09:00:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:02,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2019-10-22 09:00:02,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:02,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 28 states and 35 transitions. [2019-10-22 09:00:02,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:02,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:02,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-10-22 09:00:02,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:02,672 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 09:00:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-10-22 09:00:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-22 09:00:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 09:00:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-10-22 09:00:02,674 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 09:00:02,674 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 09:00:02,674 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:02,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-10-22 09:00:02,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:02,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:02,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:02,675 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:02,675 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:02,675 INFO L791 eck$LassoCheckResult]: Stem: 701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 698#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 699#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 704#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 696#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 690#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 691#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 697#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 707#L535-3 assume !(main_~k~0 < main_~array_size~0); 700#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 688#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 689#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 708#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 695#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 706#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 686#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 687#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 682#L518-3 [2019-10-22 09:00:02,676 INFO L793 eck$LassoCheckResult]: Loop: 682#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 683#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 682#L518-3 [2019-10-22 09:00:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash 131132986, now seen corresponding path program 3 times [2019-10-22 09:00:02,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58498460] [2019-10-22 09:00:02,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,696 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2019-10-22 09:00:02,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079932782] [2019-10-22 09:00:02,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,703 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1464749119, now seen corresponding path program 1 times [2019-10-22 09:00:02,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223813832] [2019-10-22 09:00:02,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:02,973 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2019-10-22 09:00:03,043 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:03,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:03,044 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:03,044 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:03,044 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:03,044 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:03,044 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:03,044 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:03,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration7_Lasso [2019-10-22 09:00:03,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:03,044 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:03,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:03,444 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:03,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,448 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,450 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:03,450 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:03,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,453 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:03,453 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:03,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,455 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,455 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,458 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:03,458 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:03,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,461 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,464 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,465 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,465 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,467 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:03,467 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:03,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,471 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:03,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,473 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:03,473 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:03,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:03,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,479 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,480 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,481 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:03,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:03,482 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:03,482 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:03,482 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:03,482 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:03,482 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_4) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_4 Supporting invariants [] [2019-10-22 09:00:03,501 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:00:03,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:03,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:03,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:03,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:03,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:03,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:03,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:00:03,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 45 transitions. Complement of second has 7 states. [2019-10-22 09:00:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-10-22 09:00:03,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 09:00:03,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:03,554 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:03,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:03,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:03,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:03,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:03,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:03,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:00:03,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 45 transitions. Complement of second has 7 states. [2019-10-22 09:00:03,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-10-22 09:00:03,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 09:00:03,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:03,613 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:03,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:03,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:03,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:03,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:03,643 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:03,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:00:03,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 48 states and 59 transitions. Complement of second has 6 states. [2019-10-22 09:00:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-10-22 09:00:03,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 09:00:03,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:03,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 2 letters. [2019-10-22 09:00:03,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:03,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 4 letters. [2019-10-22 09:00:03,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:03,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2019-10-22 09:00:03,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:03,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 48 transitions. [2019-10-22 09:00:03,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:00:03,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:00:03,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2019-10-22 09:00:03,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:03,663 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-10-22 09:00:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2019-10-22 09:00:03,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-10-22 09:00:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 09:00:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-22 09:00:03,666 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-22 09:00:03,666 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-22 09:00:03,667 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:03,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-10-22 09:00:03,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:03,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:03,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:03,668 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:03,668 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:03,668 INFO L791 eck$LassoCheckResult]: Stem: 1087#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1083#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 1084#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1091#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 1085#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1077#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1078#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1086#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1094#L535-3 assume !(main_~k~0 < main_~array_size~0); 1088#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 1075#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1070#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1072#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1082#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1095#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1073#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 1074#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1067#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1069#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1080#L522-2 [2019-10-22 09:00:03,668 INFO L793 eck$LassoCheckResult]: Loop: 1080#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1079#L522 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 1080#L522-2 [2019-10-22 09:00:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1464749117, now seen corresponding path program 4 times [2019-10-22 09:00:03,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407308434] [2019-10-22 09:00:03,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,685 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-10-22 09:00:03,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666800874] [2019-10-22 09:00:03,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1125370110, now seen corresponding path program 1 times [2019-10-22 09:00:03,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071600364] [2019-10-22 09:00:03,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,712 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,988 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2019-10-22 09:00:04,054 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:04,054 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:04,054 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:04,054 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:04,054 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:04,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:04,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:04,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:04,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration8_Lasso [2019-10-22 09:00:04,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:04,054 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:04,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,428 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:04,428 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:04,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,430 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,430 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,432 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,432 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,435 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,436 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,440 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,441 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,442 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,444 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,444 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,447 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,451 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,452 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,452 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,454 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,454 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,455 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,455 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,460 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,462 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,462 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,462 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,464 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,465 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,465 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,467 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,474 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,476 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,476 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,480 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,480 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,489 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,489 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,490 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,490 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,494 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:04,496 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:04,496 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:04,497 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:04,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:04,498 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:04,498 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-10-22 09:00:04,511 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:00:04,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:04,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:04,552 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:04,552 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-10-22 09:00:04,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 34 states and 42 transitions. Complement of second has 7 states. [2019-10-22 09:00:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 09:00:04,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 2 letters. [2019-10-22 09:00:04,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,565 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:04,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:04,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-10-22 09:00:04,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 34 states and 42 transitions. Complement of second has 7 states. [2019-10-22 09:00:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 09:00:04,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 2 letters. [2019-10-22 09:00:04,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:04,640 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:04,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-10-22 09:00:04,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 36 states and 46 transitions. Complement of second has 6 states. [2019-10-22 09:00:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-10-22 09:00:04,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 2 letters. [2019-10-22 09:00:04,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:00:04,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:00:04,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-10-22 09:00:04,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:04,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2019-10-22 09:00:04,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:04,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:04,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:04,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:04,663 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:04,663 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:04,663 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:04,663 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:04,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:04,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:04,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:04,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:04 BoogieIcfgContainer [2019-10-22 09:00:04,670 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:04,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:04,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:04,670 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:04,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:57" (3/4) ... [2019-10-22 09:00:04,674 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:04,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:04,675 INFO L168 Benchmark]: Toolchain (without parser) took 7832.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.9 MB). Free memory was 939.1 MB in the beginning and 998.0 MB in the end (delta: -58.9 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:04,675 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:04,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:04,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.12 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:04,677 INFO L168 Benchmark]: Boogie Preprocessor took 28.94 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:04,677 INFO L168 Benchmark]: RCFGBuilder took 364.67 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:04,678 INFO L168 Benchmark]: BuchiAutomizer took 6975.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 92.8 MB). Peak memory consumption was 217.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:04,678 INFO L168 Benchmark]: Witness Printer took 3.66 ms. Allocated memory is still 1.3 GB. Free memory is still 998.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:04,681 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.12 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.94 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.67 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6975.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 92.8 MB). Peak memory consumption was 217.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.66 ms. Allocated memory is still 1.3 GB. Free memory is still 998.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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * k + array_size and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 5.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 147 SDtfs, 188 SDslu, 122 SDs, 0 SdLazy, 239 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital173 mio100 ax111 hnf99 lsp82 ukn80 mio100 lsp59 div100 bol100 ite100 ukn100 eq169 hnf91 smp90 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 5 VariablesLoop: 3 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...