./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f42aa215a16d5e0efb670a585ba0238849a32fc4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:40:27,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:40:27,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:40:28,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:40:28,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:40:28,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:40:28,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:40:28,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:40:28,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:40:28,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:40:28,005 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:40:28,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:40:28,006 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:40:28,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:40:28,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:40:28,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:40:28,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:40:28,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:40:28,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:40:28,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:40:28,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:40:28,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:40:28,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:40:28,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:40:28,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:40:28,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:40:28,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:40:28,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:40:28,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:40:28,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:40:28,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:40:28,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:40:28,015 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:40:28,015 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:40:28,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:40:28,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:40:28,016 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 17:40:28,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:40:28,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:40:28,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:40:28,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:40:28,025 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:40:28,025 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 17:40:28,025 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 17:40:28,025 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 17:40:28,025 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 17:40:28,025 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 17:40:28,025 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 17:40:28,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 17:40:28,026 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:40:28,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 17:40:28,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:40:28,027 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:40:28,027 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 17:40:28,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:40:28,027 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 17:40:28,027 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 17:40:28,027 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 17:40:28,028 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f42aa215a16d5e0efb670a585ba0238849a32fc4 [2018-12-08 17:40:28,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:40:28,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:40:28,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:40:28,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:40:28,059 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:40:28,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:40:28,100 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/data/fba7ebc8e/917dc815f46e43c198f95f2fb0c950f8/FLAG151d0f0aa [2018-12-08 17:40:28,481 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:40:28,481 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:40:28,487 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/data/fba7ebc8e/917dc815f46e43c198f95f2fb0c950f8/FLAG151d0f0aa [2018-12-08 17:40:28,861 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/data/fba7ebc8e/917dc815f46e43c198f95f2fb0c950f8 [2018-12-08 17:40:28,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:40:28,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:40:28,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:40:28,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:40:28,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:40:28,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:40:28" (1/1) ... [2018-12-08 17:40:28,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586b3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:28, skipping insertion in model container [2018-12-08 17:40:28,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:40:28" (1/1) ... [2018-12-08 17:40:28,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:40:28,903 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:40:29,040 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:40:29,047 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:40:29,102 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:40:29,123 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:40:29,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29 WrapperNode [2018-12-08 17:40:29,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:40:29,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:40:29,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:40:29,124 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:40:29,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:40:29,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:40:29,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:40:29,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:40:29,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... [2018-12-08 17:40:29,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:40:29,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:40:29,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:40:29,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:40:29,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec11bf88-c15e-45df-a2b6-3c565c3bcf2f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:40:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:40:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 17:40:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:40:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:40:29,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:40:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:40:29,345 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:40:29,346 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-08 17:40:29,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:40:29 BoogieIcfgContainer [2018-12-08 17:40:29,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:40:29,347 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 17:40:29,347 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 17:40:29,350 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 17:40:29,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 17:40:29,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 05:40:28" (1/3) ... [2018-12-08 17:40:29,352 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59506056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 05:40:29, skipping insertion in model container [2018-12-08 17:40:29,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 17:40:29,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:40:29" (2/3) ... [2018-12-08 17:40:29,352 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59506056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 05:40:29, skipping insertion in model container [2018-12-08 17:40:29,353 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 17:40:29,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:40:29" (3/3) ... [2018-12-08 17:40:29,354 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:40:29,395 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:40:29,396 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 17:40:29,396 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 17:40:29,396 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 17:40:29,396 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:40:29,396 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:40:29,396 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 17:40:29,396 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:40:29,397 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 17:40:29,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 17:40:29,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 17:40:29,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:40:29,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:40:29,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 17:40:29,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 17:40:29,434 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 17:40:29,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 17:40:29,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 17:40:29,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:40:29,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:40:29,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 17:40:29,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 17:40:29,443 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L558-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(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; 11#L545-3true [2018-12-08 17:40:29,443 INFO L796 eck$LassoCheckResult]: Loop: 11#L545-3true assume !!(test_fun_~i~0 < test_fun_~N); 8#L546-3true assume !true; 3#L550-2true assume !true; 9#L545-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L545-3true [2018-12-08 17:40:29,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:29,448 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-08 17:40:29,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:29,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:29,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:29,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2018-12-08 17:40:29,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:29,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:29,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:40:29,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:40:29,556 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 17:40:29,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 17:40:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:40:29,566 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-08 17:40:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:40:29,571 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-08 17:40:29,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 17:40:29,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-08 17:40:29,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 17:40:29,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-12-08 17:40:29,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 17:40:29,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 17:40:29,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-08 17:40:29,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 17:40:29,578 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 17:40:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-08 17:40:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-08 17:40:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 17:40:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-08 17:40:29,594 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 17:40:29,594 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 17:40:29,594 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 17:40:29,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-08 17:40:29,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 17:40:29,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:40:29,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:40:29,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 17:40:29,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 17:40:29,596 INFO L794 eck$LassoCheckResult]: Stem: 43#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#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(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; 41#L545-3 [2018-12-08 17:40:29,596 INFO L796 eck$LassoCheckResult]: Loop: 41#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 42#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 38#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 41#L545-3 [2018-12-08 17:40:29,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-08 17:40:29,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:29,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:29,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2018-12-08 17:40:29,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:29,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2018-12-08 17:40:29,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:29,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:29,784 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:40:29,785 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:40:29,785 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:40:29,785 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:40:29,785 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:40:29,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:40:29,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:40:29,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:40:29,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-08 17:40:29,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:40:29,786 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:40:29,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:29,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:40:30,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:40:30,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,243 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:40:30,266 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 17:40:30,267 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 17:40:30,268 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:40:30,270 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 17:40:30,270 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:40:30,271 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-12-08 17:40:30,277 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 17:40:30,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:30,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:30,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:30,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 17:40:30,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-08 17:40:30,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 23 transitions. Complement of second has 4 states. [2018-12-08 17:40:30,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-12-08 17:40:30,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-08 17:40:30,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:30,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-08 17:40:30,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:30,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-12-08 17:40:30,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:30,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-12-08 17:40:30,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 17:40:30,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2018-12-08 17:40:30,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 17:40:30,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 17:40:30,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-08 17:40:30,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 17:40:30,365 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-08 17:40:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-08 17:40:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-08 17:40:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 17:40:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-12-08 17:40:30,367 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-08 17:40:30,367 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-08 17:40:30,367 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 17:40:30,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-12-08 17:40:30,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 17:40:30,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:40:30,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:40:30,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 17:40:30,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 17:40:30,368 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#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; 126#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(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; 132#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 133#L546-3 [2018-12-08 17:40:30,368 INFO L796 eck$LassoCheckResult]: Loop: 133#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 137#L546-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~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 133#L546-3 [2018-12-08 17:40:30,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,368 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-08 17:40:30,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:30,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-12-08 17:40:30,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:30,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:30,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:30,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-08 17:40:30,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:30,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,513 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:40:30,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:40:30,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:40:30,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:40:30,514 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:40:30,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:40:30,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:40:30,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:40:30,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-08 17:40:30,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:40:30,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:40:30,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:30,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:40:30,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:40:30,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:30,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,790 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 17:40:30,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,791 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 17:40:30,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:30,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:30,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:30,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:30,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:30,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:30,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:30,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:30,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:30,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:30,796 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:40:30,797 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 17:40:30,797 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 17:40:30,797 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:40:30,797 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 17:40:30,797 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:40:30,797 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-12-08 17:40:30,801 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 17:40:30,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 17:40:30,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:30,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:30,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:30,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 17:40:30,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-08 17:40:30,853 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. [2018-12-08 17:40:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-08 17:40:30,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-08 17:40:30,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:30,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-08 17:40:30,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:30,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-08 17:40:30,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:30,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-12-08 17:40:30,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 17:40:30,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2018-12-08 17:40:30,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 17:40:30,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 17:40:30,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-12-08 17:40:30,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 17:40:30,856 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-08 17:40:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-12-08 17:40:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-12-08 17:40:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 17:40:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-12-08 17:40:30,858 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-08 17:40:30,858 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-08 17:40:30,858 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 17:40:30,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-12-08 17:40:30,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 17:40:30,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:40:30,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:40:30,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:30,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 17:40:30,860 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#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; 234#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 241#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(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; 235#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 236#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 243#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 229#L550-2 [2018-12-08 17:40:30,860 INFO L796 eck$LassoCheckResult]: Loop: 229#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 230#L550 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; 229#L550-2 [2018-12-08 17:40:30,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-12-08 17:40:30,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:30,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2018-12-08 17:40:30,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2018-12-08 17:40:30,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:30,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:30,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,018 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:40:31,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:40:31,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:40:31,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:40:31,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:40:31,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:40:31,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:40:31,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:40:31,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-08 17:40:31,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:40:31,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:40:31,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:40:31,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:40:31,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,291 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:40:31,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 17:40:31,293 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 17:40:31,294 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:40:31,294 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 17:40:31,294 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:40:31,294 INFO L520 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 (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-12-08 17:40:31,299 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 17:40:31,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 17:40:31,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:31,334 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 17:40:31,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-08 17:40:31,347 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. [2018-12-08 17:40:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 17:40:31,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-08 17:40:31,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-08 17:40:31,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-08 17:40:31,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-12-08 17:40:31,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 17:40:31,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2018-12-08 17:40:31,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 17:40:31,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 17:40:31,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-12-08 17:40:31,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 17:40:31,350 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-12-08 17:40:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-12-08 17:40:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-08 17:40:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-08 17:40:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-12-08 17:40:31,352 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-08 17:40:31,352 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-08 17:40:31,352 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 17:40:31,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-12-08 17:40:31,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 17:40:31,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:40:31,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:40:31,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:31,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 17:40:31,353 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#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; 354#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 360#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(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; 355#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 356#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 369#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 365#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 368#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 366#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 357#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 359#L546-3 [2018-12-08 17:40:31,353 INFO L796 eck$LassoCheckResult]: Loop: 359#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 362#L546-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~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 359#L546-3 [2018-12-08 17:40:31,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2018-12-08 17:40:31,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:31,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-12-08 17:40:31,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:31,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:31,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:31,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2018-12-08 17:40:31,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:31,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,507 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-12-08 17:40:31,534 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:40:31,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:40:31,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:40:31,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:40:31,535 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:40:31,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:40:31,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:40:31,535 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:40:31,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-08 17:40:31,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:40:31,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:40:31,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:31,759 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:40:31,759 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:40:31,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:31,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:31,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:31,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:31,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:31,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:31,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:31,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:31,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:31,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:31,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:31,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:40:31,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 17:40:31,786 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 17:40:31,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:40:31,787 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 17:40:31,787 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:40:31,787 INFO L520 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 (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2018-12-08 17:40:31,794 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 17:40:31,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 17:40:31,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:31,830 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 17:40:31,830 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-08 17:40:31,846 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. [2018-12-08 17:40:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-08 17:40:31,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-08 17:40:31,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,847 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 17:40:31,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:31,872 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 [2018-12-08 17:40:31,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-08 17:40:31,888 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. [2018-12-08 17:40:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-08 17:40:31,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-08 17:40:31,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,889 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 17:40:31,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:31,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:31,913 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 [2018-12-08 17:40:31,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-08 17:40:31,927 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. [2018-12-08 17:40:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-08 17:40:31,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-08 17:40:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-08 17:40:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-08 17:40:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:31,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2018-12-08 17:40:31,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 17:40:31,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2018-12-08 17:40:31,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 17:40:31,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 17:40:31,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-12-08 17:40:31,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 17:40:31,932 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-12-08 17:40:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-12-08 17:40:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-12-08 17:40:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 17:40:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-12-08 17:40:31,934 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-08 17:40:31,934 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-08 17:40:31,934 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 17:40:31,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-12-08 17:40:31,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 17:40:31,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:40:31,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:40:31,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:40:31,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 17:40:31,935 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#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; 653#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 654#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(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; 655#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 656#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 664#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 668#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 657#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 659#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 648#L550-2 [2018-12-08 17:40:31,935 INFO L796 eck$LassoCheckResult]: Loop: 648#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 649#L550 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; 648#L550-2 [2018-12-08 17:40:31,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2018-12-08 17:40:31,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:31,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2018-12-08 17:40:31,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:31,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2018-12-08 17:40:31,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:40:31,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:40:31,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:40:31,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:40:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:40:32,105 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:40:32,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:40:32,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:40:32,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:40:32,105 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:40:32,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:40:32,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:40:32,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:40:32,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-08 17:40:32,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:40:32,105 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:40:32,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:40:32,371 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:40:32,371 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:40:32,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:32,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:32,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:32,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:32,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:32,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:32,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:32,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:32,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:32,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:32,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:32,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:32,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:32,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:32,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:32,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:32,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:32,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:32,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:32,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:40:32,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:32,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:32,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:32,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:40:32,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:40:32,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:32,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:32,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:32,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:32,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:32,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:32,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:32,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:32,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:40:32,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 17:40:32,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:40:32,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:40:32,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:40:32,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:40:32,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:40:32,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:40:32,400 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:40:32,402 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 17:40:32,402 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 17:40:32,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:40:32,403 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 17:40:32,403 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:40:32,403 INFO L520 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 (* 4 ULTIMATE.start_test_fun_~i~0)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3 Supporting invariants [] [2018-12-08 17:40:32,411 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-08 17:40:32,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 17:40:32,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:32,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:32,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:32,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 17:40:32,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-08 17:40:32,452 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. [2018-12-08 17:40:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 17:40:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-08 17:40:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:32,453 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 17:40:32,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:32,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:32,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:32,476 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 [2018-12-08 17:40:32,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-08 17:40:32,483 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. [2018-12-08 17:40:32,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 17:40:32,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-08 17:40:32,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:32,484 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 17:40:32,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:40:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:32,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:32,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:32,508 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 [2018-12-08 17:40:32,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-08 17:40:32,518 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. [2018-12-08 17:40:32,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 17:40:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:40:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-08 17:40:32,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-08 17:40:32,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:32,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-08 17:40:32,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:32,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-12-08 17:40:32,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:40:32,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-12-08 17:40:32,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 17:40:32,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-12-08 17:40:32,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 17:40:32,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 17:40:32,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 17:40:32,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 17:40:32,519 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:40:32,520 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:40:32,520 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:40:32,520 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 17:40:32,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:40:32,520 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 17:40:32,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 17:40:32,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 05:40:32 BoogieIcfgContainer [2018-12-08 17:40:32,524 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 17:40:32,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:40:32,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:40:32,524 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:40:32,524 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:40:29" (3/4) ... [2018-12-08 17:40:32,526 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 17:40:32,527 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:40:32,527 INFO L168 Benchmark]: Toolchain (without parser) took 3659.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:40:32,527 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:40:32,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:32,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:40:32,528 INFO L168 Benchmark]: Boogie Preprocessor took 14.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:32,528 INFO L168 Benchmark]: RCFGBuilder took 182.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:32,529 INFO L168 Benchmark]: BuchiAutomizer took 3177.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.6 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:32,529 INFO L168 Benchmark]: Witness Printer took 2.60 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:40:32,531 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 182.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3177.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.6 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.60 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] 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 3.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 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, 85 SDslu, 9 SDs, 0 SdLazy, 108 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf99 lsp89 ukn78 mio100 lsp55 div100 bol100 ite100 ukn100 eq175 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 4 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...