./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2a421301cdbe97036a5fec0597ad83df33c3e561 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:00:22,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:22,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:22,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:22,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:22,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:22,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:22,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:22,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:22,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:22,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:22,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:22,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:22,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:22,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:22,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:22,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:22,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:22,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:22,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:22,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:22,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:22,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:22,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:22,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:22,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:22,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:22,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:22,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:22,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:22,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:22,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:22,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:22,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:22,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:22,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:22,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:22,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:22,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:22,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:22,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:22,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:00:22,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:22,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:22,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:22,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:22,211 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:22,212 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:22,212 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:22,212 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:22,212 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:22,212 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:22,212 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:22,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:22,213 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:22,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:22,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:22,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:22,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:22,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:22,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:22,214 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:22,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:22,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:22,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:22,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:22,215 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:22,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:22,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:22,216 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:22,217 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:22,217 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_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a421301cdbe97036a5fec0597ad83df33c3e561 [2019-10-22 09:00:22,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:22,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:22,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:22,257 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:22,257 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:22,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i [2019-10-22 09:00:22,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/data/cb5db52a2/953011a39adf45f7b5ea0fc00e622377/FLAG4299f757c [2019-10-22 09:00:22,753 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:22,754 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/sv-benchmarks/c/termination-memory-alloca/array02-alloca-1.i [2019-10-22 09:00:22,765 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/data/cb5db52a2/953011a39adf45f7b5ea0fc00e622377/FLAG4299f757c [2019-10-22 09:00:23,124 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/bin/uautomizer/data/cb5db52a2/953011a39adf45f7b5ea0fc00e622377 [2019-10-22 09:00:23,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:23,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:23,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:23,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:23,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:23,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1250712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23, skipping insertion in model container [2019-10-22 09:00:23,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:23,176 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:23,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:23,475 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:23,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:23,558 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:23,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23 WrapperNode [2019-10-22 09:00:23,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:23,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:23,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:23,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:23,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:23,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:23,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:23,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:23,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... [2019-10-22 09:00:23,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:23,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:23,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:23,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:23,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b1167a9a-8b7d-4916-95bd-519f37b6118a/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 09:00:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:24,026 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:24,026 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:00:24,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:24 BoogieIcfgContainer [2019-10-22 09:00:24,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:24,028 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:24,028 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:24,032 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:24,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:24,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:23" (1/3) ... [2019-10-22 09:00:24,034 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2deeec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:24, skipping insertion in model container [2019-10-22 09:00:24,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:24,034 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:23" (2/3) ... [2019-10-22 09:00:24,034 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2deeec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:24, skipping insertion in model container [2019-10-22 09:00:24,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:24,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:24" (3/3) ... [2019-10-22 09:00:24,037 INFO L371 chiAutomizerObserver]: Analyzing ICFG array02-alloca-1.i [2019-10-22 09:00:24,090 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:24,090 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:24,091 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:24,091 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:24,091 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:24,091 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:24,091 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:24,091 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:24,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:00:24,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:00:24,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:24,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:24,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:00:24,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:24,137 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:24,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:00:24,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:00:24,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:24,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:24,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:00:24,139 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:24,146 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L565true assume !(main_~array_size~0 < 1); 9#L565-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;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; 16#L552-3true [2019-10-22 09:00:24,146 INFO L793 eck$LassoCheckResult]: Loop: 16#L552-3true assume !!(test_fun_~i~0 < test_fun_~N); 13#L553-3true assume !true; 5#L557-2true assume !true; 14#L552-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 16#L552-3true [2019-10-22 09:00:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,151 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 09:00:24,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:24,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868067062] [2019-10-22 09:00:24,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,275 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2019-10-22 09:00:24,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:24,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106726065] [2019-10-22 09:00:24,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:24,306 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:24,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106726065] [2019-10-22 09:00:24,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:24,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:24,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554281915] [2019-10-22 09:00:24,315 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:24,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:24,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:00:24,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:00:24,333 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-10-22 09:00:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:24,340 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-10-22 09:00:24,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:24,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-10-22 09:00:24,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:00:24,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-10-22 09:00:24,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:00:24,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:00:24,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-10-22 09:00:24,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:24,350 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 09:00:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-10-22 09:00:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 09:00:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 09:00:24,372 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 09:00:24,373 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 09:00:24,373 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:24,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 09:00:24,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:00:24,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:24,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:24,374 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:00:24,374 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:24,374 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L565 assume !(main_~array_size~0 < 1); 39#L565-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;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; 40#L552-3 [2019-10-22 09:00:24,374 INFO L793 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 43#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 42#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L552-3 [2019-10-22 09:00:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-10-22 09:00:24,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:24,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941091052] [2019-10-22 09:00:24,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,404 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2019-10-22 09:00:24,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:24,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983051769] [2019-10-22 09:00:24,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,430 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2019-10-22 09:00:24,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:24,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681401036] [2019-10-22 09:00:24,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:24,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:24,478 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:24,681 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-10-22 09:00:24,783 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:24,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:24,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:24,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:24,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:24,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:24,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:24,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:24,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration2_Lasso [2019-10-22 09:00:24,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:24,785 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:24,807 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:24,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:24,814 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:24,816 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:24,820 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:24,822 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:24,824 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:24,827 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:24,830 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:24,832 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:24,834 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:24,837 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:24,839 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:24,841 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:24,844 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:24,846 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:24,983 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:24,986 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:24,988 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:25,304 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:25,311 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:25,314 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:25,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,325 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:25,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,333 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:25,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,336 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:25,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,338 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,342 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:25,344 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:25,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,348 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:25,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,348 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,349 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,349 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,365 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:25,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,369 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:25,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,372 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:25,372 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:25,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,377 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:25,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,378 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,383 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:25,383 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:25,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,386 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:25,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,391 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,393 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:25,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,394 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,397 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:25,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,400 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:25,400 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:25,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,404 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:25,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,408 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:25,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,416 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:25,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,418 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:25,427 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:25,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,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:25,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,431 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:25,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,432 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:25,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:25,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,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:25,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:25,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:25,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:25,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:25,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:25,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:25,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:25,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:25,464 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:25,464 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:25,520 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:25,579 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-10-22 09:00:25,582 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:00:25,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:25,586 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:00:25,587 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:25,588 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1) = -4*ULTIMATE.start_test_fun_~i~0 + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 Supporting invariants [1*ULTIMATE.start_test_fun_~a.offset >= 0] [2019-10-22 09:00:25,602 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:00:25,617 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:25,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:25,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:25,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:25,715 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:25,718 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:25,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-10-22 09:00:25,787 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2019-10-22 09:00:25,787 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:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-10-22 09:00:25,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-10-22 09:00:25,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:25,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 09:00:25,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:25,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-10-22 09:00:25,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:25,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-10-22 09:00:25,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:25,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2019-10-22 09:00:25,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:00:25,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:00:25,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-10-22 09:00:25,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:25,795 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 09:00:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-10-22 09:00:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-10-22 09:00:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:00:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-10-22 09:00:25,797 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-10-22 09:00:25,797 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-10-22 09:00:25,797 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:25,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-10-22 09:00:25,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:25,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:25,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:25,798 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:25,798 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:25,799 INFO L791 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 138#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 139#L565 assume !(main_~array_size~0 < 1); 141#L565-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;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; 142#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 145#L553-3 [2019-10-22 09:00:25,799 INFO L793 eck$LassoCheckResult]: Loop: 145#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 143#L553-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; 145#L553-3 [2019-10-22 09:00:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:25,799 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-10-22 09:00:25,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:25,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241455118] [2019-10-22 09:00:25,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:25,815 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-10-22 09:00:25,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:25,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157804451] [2019-10-22 09:00:25,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:25,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-10-22 09:00:25,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:25,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299900626] [2019-10-22 09:00:25,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:25,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:25,857 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,022 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-22 09:00:26,073 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:26,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:26,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:26,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:26,074 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:26,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:26,074 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:26,074 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:26,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration3_Lasso [2019-10-22 09:00:26,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:26,076 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:26,079 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:26,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:26,091 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:26,094 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:26,096 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:26,099 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:26,101 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:26,103 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:26,105 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:26,107 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:26,109 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:26,112 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:26,115 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:26,238 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:26,239 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:26,241 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:26,242 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:26,247 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:26,249 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:26,538 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:26,538 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:26,538 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:26,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,540 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,541 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:26,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,542 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,548 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:26,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,551 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:26,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,551 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,552 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,553 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:26,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,554 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:26,554 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:26,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,561 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:26,562 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,563 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,563 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,563 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,563 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,563 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,564 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:26,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:26,566 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:26,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,578 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:26,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,578 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,580 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:26,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,582 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:26,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,587 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,587 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:26,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,589 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:26,589 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:26,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,596 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:26,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,602 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,602 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,603 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:26,603 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:26,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:26,605 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:26,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:26,606 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:26,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:26,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:26,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:26,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:26,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:26,611 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:26,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:26,612 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:26,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:26,612 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:26,612 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:26,612 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:26,627 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:00:26,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:26,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:26,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:26,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:26,673 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:26,673 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:26,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 09:00:26,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2019-10-22 09:00:26,695 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:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 09:00:26,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 09:00:26,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:26,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:00:26,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:26,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:00:26,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:26,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-10-22 09:00:26,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:26,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2019-10-22 09:00:26,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:00:26,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:00:26,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-10-22 09:00:26,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:26,699 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-10-22 09:00:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-10-22 09:00:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-10-22 09:00:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 09:00:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-10-22 09:00:26,701 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 09:00:26,701 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 09:00:26,701 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:26,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-10-22 09:00:26,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:26,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:26,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:26,702 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:26,702 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:26,703 INFO L791 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 243#L565 assume !(main_~array_size~0 < 1); 245#L565-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;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; 246#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 260#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 247#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 248#L557-2 [2019-10-22 09:00:26,703 INFO L793 eck$LassoCheckResult]: Loop: 248#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 251#L557 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~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 248#L557-2 [2019-10-22 09:00:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-10-22 09:00:26,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745407807] [2019-10-22 09:00:26,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2019-10-22 09:00:26,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667341513] [2019-10-22 09:00:26,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,725 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2019-10-22 09:00:26,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:26,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831877533] [2019-10-22 09:00:26,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:26,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:26,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:26,892 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-22 09:00:26,939 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:26,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:26,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:26,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:26,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:26,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:26,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:26,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:26,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration4_Lasso [2019-10-22 09:00:26,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:26,940 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:26,942 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:26,944 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:26,946 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:26,949 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:26,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:26,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:26,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:26,955 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:26,957 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:26,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:26,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:26,962 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:26,967 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:26,970 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:26,971 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:26,973 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:26,974 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:27,099 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:27,102 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:27,355 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:27,355 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:27,355 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:27,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,357 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:27,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,358 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:27,358 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:27,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,363 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:27,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,365 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:27,365 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:27,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,367 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:27,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,369 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:27,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,369 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,370 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:27,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,371 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:27,371 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:27,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,374 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:27,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,388 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:27,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,391 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:27,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,392 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:27,392 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:27,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,393 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:27,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,394 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,396 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:27,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,397 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,397 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,397 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:27,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,399 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:27,399 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:27,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,404 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:27,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,405 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:27,406 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:27,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,407 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:27,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,408 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,409 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:27,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,409 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,410 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,411 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:27,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:27,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:27,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:27,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:27,413 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:27,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:27,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:27,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:27,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:27,415 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:27,415 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:27,424 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:27,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:27,428 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:27,428 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:27,429 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:27,429 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:27,430 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:27,442 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:00:27,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:27,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:27,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:27,485 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:27,485 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:27,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-10-22 09:00:27,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2019-10-22 09:00:27,502 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:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 09:00:27,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:00:27,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:27,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:00:27,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:27,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 09:00:27,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:27,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-10-22 09:00:27,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:27,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2019-10-22 09:00:27,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:00:27,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:00:27,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-10-22 09:00:27,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:27,506 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-10-22 09:00:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-10-22 09:00:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-22 09:00:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 09:00:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-22 09:00:27,508 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 09:00:27,508 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 09:00:27,508 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:27,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-10-22 09:00:27,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:27,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:27,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:27,509 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:27,509 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:27,510 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 363#L565 assume !(main_~array_size~0 < 1); 365#L565-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;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; 366#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 371#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 382#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 381#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 373#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 374#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 377#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 369#L553-3 [2019-10-22 09:00:27,510 INFO L793 eck$LassoCheckResult]: Loop: 369#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 367#L553-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; 369#L553-3 [2019-10-22 09:00:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2019-10-22 09:00:27,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34371921] [2019-10-22 09:00:27,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,523 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-10-22 09:00:27,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785879377] [2019-10-22 09:00:27,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2019-10-22 09:00:27,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136897299] [2019-10-22 09:00:27,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,544 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:27,678 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-22 09:00:27,734 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:27,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:27,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:27,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:27,734 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:27,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:27,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:27,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:27,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration5_Lasso [2019-10-22 09:00:27,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:27,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:27,736 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:27,739 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:27,740 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:27,741 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:27,743 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:27,744 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:27,745 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:27,749 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:27,750 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:27,752 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:27,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 09:00:27,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:27,757 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:27,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:27,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:27,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:27,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 09:00:27,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:27,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:28,113 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:28,114 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:28,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:28,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,116 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,116 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,117 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:28,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,118 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,118 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,119 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:28,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,122 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:28,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,125 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:28,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,126 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,127 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:28,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,128 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,129 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:28,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,131 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,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:28,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,134 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,134 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,135 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:28,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,136 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,139 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:28,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,140 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,141 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:28,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,143 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,143 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,148 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:28,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,149 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,149 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,151 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:28,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,151 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,152 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,152 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,153 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:28,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,156 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:28,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,157 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,157 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,158 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,159 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,159 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,160 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:28,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,161 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,164 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,164 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,167 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:28,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,168 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,168 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,173 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:28,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,173 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:28,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,175 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:28,175 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,181 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:28,182 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,184 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,184 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,195 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:28,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,196 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,199 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:28,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,201 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,201 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:28,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,203 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:28,203 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,203 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,205 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:28,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:28,207 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:28,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:28,207 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:28,208 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:28,208 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)))_2) = -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)))_2 Supporting invariants [] [2019-10-22 09:00:28,221 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:00:28,223 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,268 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:28,268 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:28,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 09:00:28,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2019-10-22 09:00:28,321 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:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 09:00:28,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:00:28,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,321 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,361 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:28,361 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:28,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 09:00:28,378 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2019-10-22 09:00:28,378 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:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 09:00:28,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:00:28,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,379 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:28,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:28,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:28,417 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:28,417 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:28,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 09:00:28,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2019-10-22 09:00:28,438 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:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 09:00:28,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:00:28,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2019-10-22 09:00:28,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:00:28,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:28,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2019-10-22 09:00:28,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:28,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2019-10-22 09:00:28,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:00:28,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:28,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2019-10-22 09:00:28,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:28,442 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-10-22 09:00:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2019-10-22 09:00:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-10-22 09:00:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:00:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-10-22 09:00:28,444 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-10-22 09:00:28,444 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-10-22 09:00:28,444 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:28,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-10-22 09:00:28,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:28,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:28,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:28,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:28,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:28,446 INFO L791 eck$LassoCheckResult]: Stem: 663#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 661#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 662#L565 assume !(main_~array_size~0 < 1); 664#L565-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;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; 665#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 675#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 676#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 672#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 683#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 678#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 679#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 673#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 667#L557-2 [2019-10-22 09:00:28,446 INFO L793 eck$LassoCheckResult]: Loop: 667#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L557 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~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 667#L557-2 [2019-10-22 09:00:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2019-10-22 09:00:28,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:28,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547018450] [2019-10-22 09:00:28,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:28,460 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2019-10-22 09:00:28,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:28,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197549337] [2019-10-22 09:00:28,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:28,466 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2019-10-22 09:00:28,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:28,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270359051] [2019-10-22 09:00:28,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:28,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:28,481 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:28,671 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-10-22 09:00:28,723 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:28,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:28,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:28,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:28,724 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:28,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:28,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:28,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-1.i_Iteration6_Lasso [2019-10-22 09:00:28,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:28,724 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:28,726 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:28,728 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:28,843 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:28,845 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:28,846 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:28,847 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:28,848 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:28,849 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:28,851 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:28,853 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:28,855 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:28,857 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:28,858 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:28,859 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:28,860 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:28,861 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:28,863 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:28,864 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:28,865 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:29,076 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:29,076 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:29,076 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:29,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:29,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:29,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,083 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:29,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:29,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:29,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,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:29,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,094 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:29,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:29,095 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:29,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:29,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:29,102 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,102 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:29,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,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:29,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:29,105 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:29,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,106 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:29,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:29,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:29,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,110 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:29,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:29,112 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,112 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:29,115 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:29,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:29,117 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:29,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:29,118 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:29,119 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:29,119 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)))_3) = 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)))_3 Supporting invariants [] [2019-10-22 09:00:29,139 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:00:29,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,187 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:29,187 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:29,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:00:29,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2019-10-22 09:00:29,204 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:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 09:00:29,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-10-22 09:00:29,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,204 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,235 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:29,236 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:29,236 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:00:29,249 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2019-10-22 09:00:29,249 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:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 09:00:29,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-10-22 09:00:29,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,250 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:29,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:29,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:29,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:29,278 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:29,278 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:29,278 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:00:29,292 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2019-10-22 09:00:29,294 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:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:00:29,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2019-10-22 09:00:29,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:00:29,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2019-10-22 09:00:29,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:29,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-10-22 09:00:29,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:29,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-10-22 09:00:29,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:29,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:29,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:29,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:29,297 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:29,297 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:29,297 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:29,297 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:29,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:29,297 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:29,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:29,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:29 BoogieIcfgContainer [2019-10-22 09:00:29,302 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:29,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:29,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:29,303 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:29,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:24" (3/4) ... [2019-10-22 09:00:29,305 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:29,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:29,306 INFO L168 Benchmark]: Toolchain (without parser) took 6178.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 185.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:29,307 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:29,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:29,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:29,308 INFO L168 Benchmark]: Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:29,308 INFO L168 Benchmark]: RCFGBuilder took 392.06 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:29,309 INFO L168 Benchmark]: BuchiAutomizer took 5274.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:29,309 INFO L168 Benchmark]: Witness Printer took 2.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:29,311 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 429.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 392.06 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5274.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[a] and consists of 4 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][a + i * 4] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + i * 4] 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. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 88 SDslu, 9 SDs, 0 SdLazy, 106 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital154 mio100 ax111 hnf99 lsp80 ukn75 mio100 lsp53 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...