./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/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 64bit --witnessprinter.graph.data.programhash f5878942b695ddbfe46daa43f5d95028455ef120 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 08:23:52,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 08:23:52,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 08:23:52,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 08:23:52,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 08:23:52,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 08:23:52,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 08:23:52,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 08:23:52,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 08:23:52,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 08:23:52,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 08:23:52,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 08:23:52,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 08:23:52,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 08:23:52,063 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 08:23:52,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 08:23:52,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 08:23:52,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 08:23:52,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 08:23:52,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 08:23:52,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 08:23:52,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 08:23:52,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 08:23:52,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 08:23:52,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 08:23:52,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 08:23:52,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 08:23:52,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 08:23:52,074 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 08:23:52,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 08:23:52,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 08:23:52,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 08:23:52,075 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 08:23:52,075 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 08:23:52,076 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 08:23:52,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 08:23:52,077 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 08:23:52,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 08:23:52,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 08:23:52,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 08:23:52,089 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 08:23:52,089 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 08:23:52,089 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 08:23:52,089 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 08:23:52,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 08:23:52,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 08:23:52,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 08:23:52,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 08:23:52,091 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 08:23:52,091 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 08:23:52,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 08:23:52,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 08:23:52,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 08:23:52,091 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 08:23:52,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 08:23:52,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 08:23:52,092 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 08:23:52,092 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 08:23:52,092 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_52e7c992-bd20-45db-af3c-e01d9f7d3224/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5878942b695ddbfe46daa43f5d95028455ef120 [2018-12-01 08:23:52,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 08:23:52,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 08:23:52,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 08:23:52,127 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 08:23:52,128 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 08:23:52,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-12-01 08:23:52,168 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/data/128f3298e/9b4cef57d59b4b40b07b3ac9bef924fa/FLAGcc4bcb992 [2018-12-01 08:23:52,597 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 08:23:52,597 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-12-01 08:23:52,603 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/data/128f3298e/9b4cef57d59b4b40b07b3ac9bef924fa/FLAGcc4bcb992 [2018-12-01 08:23:52,611 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/data/128f3298e/9b4cef57d59b4b40b07b3ac9bef924fa [2018-12-01 08:23:52,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 08:23:52,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 08:23:52,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 08:23:52,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 08:23:52,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 08:23:52,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e0bb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52, skipping insertion in model container [2018-12-01 08:23:52,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 08:23:52,639 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 08:23:52,776 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:23:52,783 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 08:23:52,857 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 08:23:52,879 INFO L195 MainTranslator]: Completed translation [2018-12-01 08:23:52,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52 WrapperNode [2018-12-01 08:23:52,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 08:23:52,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 08:23:52,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 08:23:52,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 08:23:52,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 08:23:52,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 08:23:52,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 08:23:52,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 08:23:52,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... [2018-12-01 08:23:52,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 08:23:52,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 08:23:52,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 08:23:52,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 08:23:52,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/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-01 08:23:52,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 08:23:52,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 08:23:52,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 08:23:52,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 08:23:52,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 08:23:52,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 08:23:53,090 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 08:23:53,090 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 08:23:53,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:23:53 BoogieIcfgContainer [2018-12-01 08:23:53,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 08:23:53,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 08:23:53,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 08:23:53,093 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 08:23:53,094 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 08:23:53,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 08:23:52" (1/3) ... [2018-12-01 08:23:53,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@730c8ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:23:53, skipping insertion in model container [2018-12-01 08:23:53,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 08:23:53,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:23:52" (2/3) ... [2018-12-01 08:23:53,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@730c8ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:23:53, skipping insertion in model container [2018-12-01 08:23:53,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 08:23:53,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:23:53" (3/3) ... [2018-12-01 08:23:53,096 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-12-01 08:23:53,130 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 08:23:53,130 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 08:23:53,130 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 08:23:53,130 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 08:23:53,130 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 08:23:53,130 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 08:23:53,130 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 08:23:53,130 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 08:23:53,130 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 08:23:53,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-01 08:23:53,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:23:53,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:53,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:53,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 08:23:53,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 08:23:53,156 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 08:23:53,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-01 08:23:53,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:23:53,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:53,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:53,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 08:23:53,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 08:23:53,162 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L555-3true [2018-12-01 08:23:53,162 INFO L796 eck$LassoCheckResult]: Loop: 6#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 13#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L557-3true assume !true; 4#L557-4true call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 6#L555-3true [2018-12-01 08:23:53,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 08:23:53,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:53,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-12-01 08:23:53,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:53,271 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-01 08:23:53,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:23:53,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 08:23:53,274 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 08:23:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 08:23:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 08:23:53,284 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-01 08:23:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:23:53,288 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-01 08:23:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 08:23:53,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-12-01 08:23:53,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:23:53,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-12-01 08:23:53,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 08:23:53,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-01 08:23:53,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-12-01 08:23:53,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 08:23:53,294 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-01 08:23:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-12-01 08:23:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-01 08:23:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:23:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-01 08:23:53,310 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-01 08:23:53,310 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-01 08:23:53,310 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 08:23:53,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-01 08:23:53,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 08:23:53,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:53,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:53,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 08:23:53,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 08:23:53,311 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2018-12-01 08:23:53,311 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 36#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 38#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 34#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 33#L555-3 [2018-12-01 08:23:53,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-01 08:23:53,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-12-01 08:23:53,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-12-01 08:23:53,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:53,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:53,430 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-01 08:23:53,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 08:23:53,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 08:23:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 08:23:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 08:23:53,495 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-12-01 08:23:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:23:53,533 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-01 08:23:53,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 08:23:53,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-12-01 08:23:53,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:23:53,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-12-01 08:23:53,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 08:23:53,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 08:23:53,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-12-01 08:23:53,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 08:23:53,535 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-01 08:23:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-12-01 08:23:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-01 08:23:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 08:23:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-01 08:23:53,536 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-01 08:23:53,536 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-01 08:23:53,536 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 08:23:53,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-12-01 08:23:53,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:23:53,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:53,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:53,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 08:23:53,537 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-01 08:23:53,537 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 62#L555-3 [2018-12-01 08:23:53,537 INFO L796 eck$LassoCheckResult]: Loop: 62#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 65#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 68#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 66#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 67#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 69#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 63#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 62#L555-3 [2018-12-01 08:23:53,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-01 08:23:53,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,550 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2018-12-01 08:23:53,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:53,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 1 times [2018-12-01 08:23:53,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:53,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:53,845 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-12-01 08:23:53,924 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:23:53,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:23:53,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:23:53,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:23:53,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:23:53,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:23:53,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:23:53,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:23:53,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-01 08:23:53,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:23:53,925 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:23:53,940 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-01 08:23:53,944 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-01 08:23:53,945 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-01 08:23:53,946 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-01 08:23:53,948 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-01 08:23:53,950 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-01 08:23:53,952 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-01 08:23:54,118 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-12-01 08:23:54,166 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-01 08:23:54,167 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-01 08:23:54,169 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-01 08:23:54,170 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-01 08:23:54,171 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-01 08:23:54,173 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-01 08:23:54,174 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-01 08:23:54,176 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-01 08:23:54,433 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:23:54,436 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:23:54,437 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-01 08:23:54,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:54,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:54,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:54,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,442 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-01 08:23:54,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:54,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:54,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:54,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,444 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-01 08:23:54,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:54,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:54,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:54,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,445 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-01 08:23:54,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,449 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-01 08:23:54,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:54,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:54,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:54,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,451 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-01 08:23:54,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,455 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-01 08:23:54,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,459 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-01 08:23:54,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,464 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-01 08:23:54,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,465 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:23:54,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,466 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:23:54,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,470 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-01 08:23:54,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,474 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-01 08:23:54,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,477 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-01 08:23:54,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,477 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:23:54,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:23:54,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,483 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-01 08:23:54,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:54,497 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-01 08:23:54,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:54,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:54,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:54,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:54,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:54,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:54,505 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:23:54,509 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 08:23:54,509 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 08:23:54,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:23:54,512 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:23:54,512 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:23:54,512 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-01 08:23:54,578 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-12-01 08:23:54,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:23:54,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:54,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:54,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:54,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-12-01 08:23:54,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-01 08:23:54,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:54,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-12-01 08:23:54,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 08:23:54,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:54,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:54,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-12-01 08:23:54,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-12-01 08:23:54,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:23:54,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:54,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:54,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-12-01 08:23:54,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-01 08:23:54,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:54,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:54,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-01 08:23:54,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:54,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:54,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:54,827 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:22 [2018-12-01 08:23:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:23:54,871 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-01 08:23:54,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-12-01 08:23:54,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 7 states. Result 23 states and 26 transitions. Complement of second has 13 states. [2018-12-01 08:23:54,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-01 08:23:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 08:23:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-01 08:23:54,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-01 08:23:54,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:54,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-01 08:23:54,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:54,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-01 08:23:54,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:54,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-12-01 08:23:54,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:23:54,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 25 transitions. [2018-12-01 08:23:54,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-01 08:23:54,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-01 08:23:54,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-12-01 08:23:54,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:23:54,979 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-01 08:23:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-12-01 08:23:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-01 08:23:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 08:23:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-01 08:23:54,980 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-01 08:23:54,981 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-01 08:23:54,981 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 08:23:54,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-01 08:23:54,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:23:54,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:54,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:54,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 08:23:54,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-01 08:23:54,982 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 239#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 240#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 248#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 258#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 249#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 250#L557-3 [2018-12-01 08:23:54,983 INFO L796 eck$LassoCheckResult]: Loop: 250#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 253#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 256#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 255#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 241#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 242#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 246#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 250#L557-3 [2018-12-01 08:23:54,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-12-01 08:23:54,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:54,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:54,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:54,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:54,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:55,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:55,001 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 2 times [2018-12-01 08:23:55,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:55,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:55,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:55,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 2 times [2018-12-01 08:23:55,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:55,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:55,384 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-12-01 08:23:55,459 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:23:55,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:23:55,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:23:55,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:23:55,459 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:23:55,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:23:55,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:23:55,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:23:55,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-12-01 08:23:55,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:23:55,460 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:23:55,462 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-01 08:23:55,463 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-01 08:23:55,464 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-01 08:23:55,465 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-01 08:23:55,466 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-01 08:23:55,467 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-01 08:23:55,468 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-01 08:23:55,679 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-01 08:23:55,680 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-01 08:23:55,681 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-01 08:23:55,682 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-01 08:23:55,683 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-01 08:23:55,685 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-01 08:23:55,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 08:23:55,687 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-01 08:23:55,687 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-01 08:23:55,942 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:23:55,943 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:23:55,943 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-01 08:23:55,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:55,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:55,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:55,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,945 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-01 08:23:55,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:55,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:55,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,947 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-01 08:23:55,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:55,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:55,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:55,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,949 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-01 08:23:55,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:55,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:55,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:55,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,950 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-01 08:23:55,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:55,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:55,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:55,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,951 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-01 08:23:55,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:55,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:55,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,954 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-01 08:23:55,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:55,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:55,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,968 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-01 08:23:55,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:55,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:55,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,972 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-01 08:23:55,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:55,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:55,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:55,978 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-01 08:23:55,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:55,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:55,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:55,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:55,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:55,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:55,990 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:23:56,004 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-01 08:23:56,004 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 08:23:56,004 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:23:56,005 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:23:56,005 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:23:56,005 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-12-01 08:23:56,062 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-01 08:23:56,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:23:56,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:56,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:56,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:56,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:56,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:23:56,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:56,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-12-01 08:23:56,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:56,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:56,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:56,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-01 08:23:56,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:56,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-12-01 08:23:56,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:56,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-01 08:23:56,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:56,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:56,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:56,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 52 [2018-12-01 08:23:56,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:23:56,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:56,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:56,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:38 [2018-12-01 08:23:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:23:56,242 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-01 08:23:56,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-01 08:23:56,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 63 states and 69 transitions. Complement of second has 21 states. [2018-12-01 08:23:56,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-12-01 08:23:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 08:23:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-12-01 08:23:56,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. Stem has 6 letters. Loop has 7 letters. [2018-12-01 08:23:56,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:56,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. Stem has 13 letters. Loop has 7 letters. [2018-12-01 08:23:56,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:56,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. Stem has 6 letters. Loop has 14 letters. [2018-12-01 08:23:56,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:56,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2018-12-01 08:23:56,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:23:56,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 51 transitions. [2018-12-01 08:23:56,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-01 08:23:56,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-01 08:23:56,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2018-12-01 08:23:56,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:23:56,476 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-01 08:23:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2018-12-01 08:23:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-12-01 08:23:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 08:23:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-12-01 08:23:56,480 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-12-01 08:23:56,480 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-12-01 08:23:56,480 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 08:23:56,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2018-12-01 08:23:56,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 08:23:56,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:56,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:56,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-01 08:23:56,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-01 08:23:56,482 INFO L794 eck$LassoCheckResult]: Stem: 513#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 508#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 515#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 523#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 517#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 518#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 529#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 527#L557-3 [2018-12-01 08:23:56,483 INFO L796 eck$LassoCheckResult]: Loop: 527#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 526#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 525#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 524#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 509#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 510#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 530#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 527#L557-3 [2018-12-01 08:23:56,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2018-12-01 08:23:56,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:56,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:56,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 3 times [2018-12-01 08:23:56,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:56,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:56,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:56,509 INFO L82 PathProgramCache]: Analyzing trace with hash -664221883, now seen corresponding path program 3 times [2018-12-01 08:23:56,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:56,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:56,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:56,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:56,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:57,281 WARN L180 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2018-12-01 08:23:57,384 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-01 08:23:57,386 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:23:57,386 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:23:57,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:23:57,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:23:57,386 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:23:57,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:23:57,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:23:57,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:23:57,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-01 08:23:57,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:23:57,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:23:57,388 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-01 08:23:57,390 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-01 08:23:57,391 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-01 08:23:57,398 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-01 08:23:57,399 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-01 08:23:57,400 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-01 08:23:57,402 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-01 08:23:57,403 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-01 08:23:57,615 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-01 08:23:57,616 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-01 08:23:57,617 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-01 08:23:57,617 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-01 08:23:57,619 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-01 08:23:57,620 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-01 08:23:57,621 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-01 08:23:57,622 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-01 08:23:57,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:23:57,849 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:23:57,849 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-01 08:23:57,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:57,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:57,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:57,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,850 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-01 08:23:57,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,852 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-01 08:23:57,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,854 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-01 08:23:57,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:57,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:57,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:57,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,855 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-01 08:23:57,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:57,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:57,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:57,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,856 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-01 08:23:57,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,858 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-01 08:23:57,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,860 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-01 08:23:57,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,861 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-01 08:23:57,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,864 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-01 08:23:57,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,867 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-01 08:23:57,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,867 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:23:57,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,868 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:23:57,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,870 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-01 08:23:57,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,871 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-01 08:23:57,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:57,873 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-01 08:23:57,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:57,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:57,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:57,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:57,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:57,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:57,880 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:23:57,886 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 08:23:57,886 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 08:23:57,886 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:23:57,887 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 08:23:57,887 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:23:57,887 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-01 08:23:57,947 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-01 08:23:57,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:23:57,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:57,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:57,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:57,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-12-01 08:23:58,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-01 08:23:58,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:58,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-12-01 08:23:58,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:58,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:58,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:58,042 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:50 [2018-12-01 08:23:58,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-12-01 08:23:58,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-12-01 08:23:58,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:58,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:58,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-12-01 08:23:58,126 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 08:23:58,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:58,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2018-12-01 08:23:58,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:58,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:58,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:58,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:61 [2018-12-01 08:23:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:23:58,173 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-01 08:23:58,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-01 08:23:58,309 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 70 states and 81 transitions. Complement of second has 17 states. [2018-12-01 08:23:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-12-01 08:23:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 08:23:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-12-01 08:23:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 8 letters. Loop has 7 letters. [2018-12-01 08:23:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 15 letters. Loop has 7 letters. [2018-12-01 08:23:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 8 letters. Loop has 14 letters. [2018-12-01 08:23:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:58,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 81 transitions. [2018-12-01 08:23:58,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-01 08:23:58,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 66 transitions. [2018-12-01 08:23:58,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-01 08:23:58,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-01 08:23:58,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 66 transitions. [2018-12-01 08:23:58,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:23:58,313 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-12-01 08:23:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 66 transitions. [2018-12-01 08:23:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-12-01 08:23:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-01 08:23:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-12-01 08:23:58,315 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-01 08:23:58,315 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-01 08:23:58,316 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 08:23:58,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2018-12-01 08:23:58,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-01 08:23:58,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:58,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:58,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-01 08:23:58,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 08:23:58,317 INFO L794 eck$LassoCheckResult]: Stem: 796#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 790#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 791#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 798#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 806#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 830#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 827#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 800#L557-1 [2018-12-01 08:23:58,317 INFO L796 eck$LassoCheckResult]: Loop: 800#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 801#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 800#L557-1 [2018-12-01 08:23:58,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907812, now seen corresponding path program 3 times [2018-12-01 08:23:58,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:58,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:58,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:58,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:58,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:58,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 1 times [2018-12-01 08:23:58,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:58,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:58,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:58,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:58,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:58,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:58,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 4 times [2018-12-01 08:23:58,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:58,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:58,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:23:58,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:58,623 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2018-12-01 08:23:58,774 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-01 08:23:58,777 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:23:58,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:23:58,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:23:58,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:23:58,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:23:58,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:23:58,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:23:58,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:23:58,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-12-01 08:23:58,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:23:58,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:23:58,782 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-01 08:23:58,784 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-01 08:23:58,786 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-01 08:23:58,787 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-01 08:23:58,790 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-01 08:23:58,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-01 08:23:58,807 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-01 08:23:58,808 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-01 08:23:58,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-01 08:23:58,987 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-01 08:23:58,988 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-01 08:23:58,989 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-01 08:23:58,990 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-01 08:23:59,252 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:23:59,253 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:23:59,253 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-01 08:23:59,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:59,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:59,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:59,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,254 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-01 08:23:59,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:59,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:59,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:59,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,255 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-01 08:23:59,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:59,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:59,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:59,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,256 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-01 08:23:59,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,258 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-01 08:23:59,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:59,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:59,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:59,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,259 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-01 08:23:59,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,261 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-01 08:23:59,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:23:59,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:23:59,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:23:59,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,263 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-01 08:23:59,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,265 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-01 08:23:59,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,268 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-01 08:23:59,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,277 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-01 08:23:59,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,280 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-01 08:23:59,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,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-01 08:23:59,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,282 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:23:59,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,283 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:23:59,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,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-01 08:23:59,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,288 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-01 08:23:59,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,291 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-01 08:23:59,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,293 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-01 08:23:59,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:23:59,297 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-01 08:23:59,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:23:59,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:23:59,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:23:59,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:23:59,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:23:59,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:23:59,312 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:23:59,324 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 08:23:59,324 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 08:23:59,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:23:59,325 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-01 08:23:59,325 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:23:59,325 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4, ULTIMATE.start_test_fun_#t~mem6) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 - 1*ULTIMATE.start_test_fun_#t~mem6 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem6 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 >= 0, 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 - 1*ULTIMATE.start_test_fun_#t~mem7 >= 0] [2018-12-01 08:23:59,379 INFO L297 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2018-12-01 08:23:59,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:23:59,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:59,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:59,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:59,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-01 08:23:59,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-01 08:23:59,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-01 08:23:59,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:23:59,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 08:23:59,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,475 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-12-01 08:23:59,482 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-01 08:23:59,482 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-01 08:23:59,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-01 08:23:59,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 51 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 65 states and 76 transitions. Complement of second has 5 states. [2018-12-01 08:23:59,506 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-01 08:23:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 08:23:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 08:23:59,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 08:23:59,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:59,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 08:23:59,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:59,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-01 08:23:59,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:23:59,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 76 transitions. [2018-12-01 08:23:59,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-01 08:23:59,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 57 states and 66 transitions. [2018-12-01 08:23:59,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-01 08:23:59,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-01 08:23:59,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2018-12-01 08:23:59,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:23:59,509 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-12-01 08:23:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2018-12-01 08:23:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-12-01 08:23:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-01 08:23:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-12-01 08:23:59,512 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-12-01 08:23:59,512 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-12-01 08:23:59,512 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 08:23:59,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2018-12-01 08:23:59,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-01 08:23:59,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:23:59,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:23:59,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-12-01 08:23:59,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-01 08:23:59,514 INFO L794 eck$LassoCheckResult]: Stem: 1044#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1038#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1039#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1045#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1054#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1071#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1070#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1065#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1064#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1063#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1062#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1061#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1059#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1058#L557-3 [2018-12-01 08:23:59,514 INFO L796 eck$LassoCheckResult]: Loop: 1058#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1057#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1056#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1055#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1040#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1041#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1060#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1058#L557-3 [2018-12-01 08:23:59,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 4 times [2018-12-01 08:23:59,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:59,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:59,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:23:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:23:59,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 08:23:59,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52e7c992-bd20-45db-af3c-e01d9f7d3224/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 08:23:59,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 08:23:59,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 08:23:59,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 08:23:59,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:23:59,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 08:23:59,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 08:23:59,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-01 08:23:59,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:23:59,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:23:59,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-01 08:23:59,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 52 [2018-12-01 08:23:59,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-12-01 08:23:59,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 47 [2018-12-01 08:23:59,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:23:59,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:59,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 08:23:59,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-12-01 08:23:59,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-12-01 08:23:59,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-12-01 08:23:59,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-01 08:23:59,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:23:59,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-01 08:23:59,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:23:59,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 08:23:59,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 08:23:59,798 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:23:59,802 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:44, output treesize:3 [2018-12-01 08:23:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 08:23:59,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 08:23:59,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-12-01 08:23:59,820 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 08:23:59,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:23:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 4 times [2018-12-01 08:23:59,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:23:59,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:23:59,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:59,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:23:59,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:23:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:23:59,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 08:23:59,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-01 08:23:59,907 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand 13 states. [2018-12-01 08:24:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 08:24:00,029 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-12-01 08:24:00,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 08:24:00,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 56 transitions. [2018-12-01 08:24:00,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 08:24:00,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 34 states and 38 transitions. [2018-12-01 08:24:00,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 08:24:00,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 08:24:00,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2018-12-01 08:24:00,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:24:00,031 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-01 08:24:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2018-12-01 08:24:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-01 08:24:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-01 08:24:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-12-01 08:24:00,032 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-12-01 08:24:00,033 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-12-01 08:24:00,033 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 08:24:00,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-12-01 08:24:00,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 08:24:00,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:24:00,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:24:00,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 1, 1, 1, 1] [2018-12-01 08:24:00,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 08:24:00,034 INFO L794 eck$LassoCheckResult]: Stem: 1198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1194#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1195#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1199#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1206#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1214#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1213#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1212#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1211#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1207#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1196#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1197#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1200#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1205#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1201#L557-1 [2018-12-01 08:24:00,034 INFO L796 eck$LassoCheckResult]: Loop: 1201#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1202#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1201#L557-1 [2018-12-01 08:24:00,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -300113017, now seen corresponding path program 5 times [2018-12-01 08:24:00,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:24:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:24:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:00,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:24:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:00,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:00,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 2 times [2018-12-01 08:24:00,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:24:00,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:24:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:00,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:24:00,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:00,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 6 times [2018-12-01 08:24:00,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:24:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:24:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:00,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:24:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:01,667 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 168 DAG size of output: 156 [2018-12-01 08:24:01,898 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-01 08:24:01,901 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:24:01,901 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:24:01,901 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:24:01,901 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:24:01,901 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:24:01,901 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:24:01,901 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:24:01,901 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:24:01,901 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-12-01 08:24:01,901 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:24:01,901 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:24:01,903 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-01 08:24:02,166 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-01 08:24:02,167 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-01 08:24:02,168 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-01 08:24:02,169 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-01 08:24:02,170 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-01 08:24:02,171 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-01 08:24:02,172 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-01 08:24:02,173 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-01 08:24:02,174 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-01 08:24:02,175 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-01 08:24:02,176 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-01 08:24:02,177 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-01 08:24:02,178 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-01 08:24:02,414 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:24:02,414 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:24:02,414 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-01 08:24:02,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:02,414 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:24:02,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:02,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:02,415 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:24:02,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:02,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:02,418 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-01 08:24:02,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:02,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:02,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:02,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:02,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:02,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:02,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:02,420 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-01 08:24:02,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:02,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:02,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:02,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:02,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:02,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:02,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:02,422 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-01 08:24:02,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:02,423 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:24:02,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:02,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:02,424 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:24:02,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:02,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:02,426 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-01 08:24:02,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:02,426 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:24:02,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:02,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:02,427 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:24:02,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:02,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:02,429 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-01 08:24:02,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:02,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:02,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:02,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:02,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:02,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:02,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:24:02,446 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 08:24:02,446 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 08:24:02,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:24:02,447 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-01 08:24:02,447 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:24:02,447 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7) = -1*ULTIMATE.start_test_fun_#t~mem6 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [3*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 - 3*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5 + 4 >= 0] [2018-12-01 08:24:02,500 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-01 08:24:02,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:02,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:02,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 08:24:02,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 08:24:02,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-01 08:24:02,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 08:24:02,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 08:24:02,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-01 08:24:02,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:24:02,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:24:02,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-01 08:24:02,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:24:02,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:24:02,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-01 08:24:02,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-01 08:24:02,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-01 08:24:02,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-01 08:24:02,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-01 08:24:02,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-01 08:24:02,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-01 08:24:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:02,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:02,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2018-12-01 08:24:02,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-12-01 08:24:02,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-01 08:24:02,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-01 08:24:02,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,755 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-12-01 08:24:02,765 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-01 08:24:02,765 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-12-01 08:24:02,765 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-12-01 08:24:02,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5. Second operand 11 states. Result 21 states and 24 transitions. Complement of second has 5 states. [2018-12-01 08:24:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-01 08:24:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 08:24:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-12-01 08:24:02,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-01 08:24:02,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:02,790 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:24:02,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:02,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:02,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 08:24:02,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 08:24:02,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-01 08:24:02,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 08:24:02,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 08:24:02,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-01 08:24:02,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:24:02,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:24:02,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-01 08:24:02,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:24:02,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:24:02,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-01 08:24:02,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-01 08:24:02,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-01 08:24:02,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-01 08:24:02,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:02,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-01 08:24:02,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-01 08:24:02,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:02,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-01 08:24:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:02,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:03,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2018-12-01 08:24:03,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-12-01 08:24:03,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-01 08:24:03,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-01 08:24:03,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-12-01 08:24:03,060 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-01 08:24:03,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2018-12-01 08:24:03,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-12-01 08:24:03,084 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5. Second operand 11 states. Result 21 states and 24 transitions. Complement of second has 5 states. [2018-12-01 08:24:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-01 08:24:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 08:24:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-12-01 08:24:03,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-01 08:24:03,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:03,085 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:24:03,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:03,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:03,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-01 08:24:03,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 08:24:03,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-01 08:24:03,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 08:24:03,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 08:24:03,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-01 08:24:03,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:24:03,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:24:03,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-01 08:24:03,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-01 08:24:03,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 08:24:03,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-01 08:24:03,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-01 08:24:03,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-01 08:24:03,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-01 08:24:03,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-01 08:24:03,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-01 08:24:03,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-01 08:24:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:03,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:03,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2018-12-01 08:24:03,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-01 08:24:03,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:03,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2018-12-01 08:24:03,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 08:24:03,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 08:24:03,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-12-01 08:24:03,353 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-01 08:24:03,353 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-12-01 08:24:03,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-12-01 08:24:03,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5. Second operand 11 states. Result 55 states and 64 transitions. Complement of second has 22 states. [2018-12-01 08:24:03,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-01 08:24:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 08:24:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-12-01 08:24:03,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-01 08:24:03,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:03,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-01 08:24:03,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:03,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-01 08:24:03,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:03,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2018-12-01 08:24:03,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 08:24:03,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 42 states and 48 transitions. [2018-12-01 08:24:03,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 08:24:03,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 08:24:03,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-12-01 08:24:03,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 08:24:03,444 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-01 08:24:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-12-01 08:24:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-12-01 08:24:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 08:24:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-01 08:24:03,446 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-01 08:24:03,446 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-01 08:24:03,446 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 08:24:03,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2018-12-01 08:24:03,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 08:24:03,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 08:24:03,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 08:24:03,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 1, 1, 1, 1] [2018-12-01 08:24:03,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 08:24:03,447 INFO L794 eck$LassoCheckResult]: Stem: 1653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1649#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1650#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1654#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1660#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1656#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1657#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1676#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1674#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1672#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1664#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1663#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1651#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1652#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1655#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1667#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1665#L557-1 [2018-12-01 08:24:03,447 INFO L796 eck$LassoCheckResult]: Loop: 1665#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1666#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1665#L557-1 [2018-12-01 08:24:03,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 883958124, now seen corresponding path program 7 times [2018-12-01 08:24:03,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:24:03,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:24:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:03,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:24:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:03,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 3 times [2018-12-01 08:24:03,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:24:03,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:24:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 08:24:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:03,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:03,467 INFO L82 PathProgramCache]: Analyzing trace with hash -919766745, now seen corresponding path program 8 times [2018-12-01 08:24:03,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 08:24:03,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 08:24:03,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:03,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 08:24:03,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 08:24:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 08:24:05,703 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 182 DAG size of output: 163 [2018-12-01 08:24:05,872 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-01 08:24:05,874 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 08:24:05,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 08:24:05,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 08:24:05,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 08:24:05,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 08:24:05,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 08:24:05,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 08:24:05,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 08:24:05,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration9_Lasso [2018-12-01 08:24:05,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 08:24:05,875 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 08:24:05,876 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-01 08:24:05,878 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-01 08:24:05,879 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-01 08:24:05,880 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-01 08:24:05,881 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-01 08:24:05,883 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-01 08:24:06,097 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-01 08:24:06,098 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-01 08:24:06,099 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-01 08:24:06,100 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-01 08:24:06,101 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-01 08:24:06,102 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-01 08:24:06,102 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-01 08:24:06,104 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-01 08:24:06,319 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 08:24:06,319 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 08:24:06,320 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-01 08:24:06,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,321 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-01 08:24:06,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:24:06,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:24:06,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:24:06,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,322 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-01 08:24:06,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 08:24:06,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 08:24:06,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 08:24:06,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,323 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-01 08:24:06,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,325 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-01 08:24:06,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,326 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-01 08:24:06,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,329 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-01 08:24:06,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,331 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-01 08:24:06,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,332 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:24:06,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,332 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:24:06,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,334 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-01 08:24:06,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,338 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-01 08:24:06,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,341 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-01 08:24:06,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,348 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-01 08:24:06,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,352 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-01 08:24:06,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,354 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-01 08:24:06,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,354 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 08:24:06,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,355 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 08:24:06,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 08:24:06,357 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-01 08:24:06,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 08:24:06,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 08:24:06,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 08:24:06,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 08:24:06,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 08:24:06,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 08:24:06,368 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 08:24:06,376 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 08:24:06,376 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 08:24:06,377 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 08:24:06,377 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-01 08:24:06,377 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 08:24:06,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_6, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_6 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_6 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_6 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_6 + 1*ULTIMATE.start_test_fun_#t~mem6 - 1*ULTIMATE.start_test_fun_#t~mem7 >= 0] [2018-12-01 08:24:06,418 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-12-01 08:24:06,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:24:06,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 08:24:06,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:06,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:06,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:06,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-01 08:24:06,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-12-01 08:24:06,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:06,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-12-01 08:24:06,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:06,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:24:06,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:24:06,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-01 08:24:06,530 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-01 08:24:06,531 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-01 08:24:06,531 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 08:24:06,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 37 states and 42 transitions. Complement of second has 6 states. [2018-12-01 08:24:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-01 08:24:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 08:24:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-01 08:24:06,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-01 08:24:06,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:06,553 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:24:06,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:06,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:06,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:06,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-01 08:24:06,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-12-01 08:24:06,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:06,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-12-01 08:24:06,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:06,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:24:06,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:24:06,646 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-01 08:24:06,661 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-01 08:24:06,661 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-01 08:24:06,661 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 08:24:06,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 38 states and 44 transitions. Complement of second has 5 states. [2018-12-01 08:24:06,679 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-01 08:24:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 08:24:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 08:24:06,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-01 08:24:06,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:06,680 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 08:24:06,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 08:24:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:06,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 08:24:06,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 08:24:06,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-12-01 08:24:06,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-12-01 08:24:06,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:06,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 08:24:06,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-12-01 08:24:06,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 08:24:06,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:24:06,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 08:24:06,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-12-01 08:24:06,799 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-01 08:24:06,799 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-01 08:24:06,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 08:24:06,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 42 states and 47 transitions. Complement of second has 5 states. [2018-12-01 08:24:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-01 08:24:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 08:24:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-01 08:24:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-01 08:24:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 2 letters. [2018-12-01 08:24:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-01 08:24:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 08:24:06,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 47 transitions. [2018-12-01 08:24:06,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 08:24:06,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-12-01 08:24:06,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 08:24:06,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 08:24:06,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 08:24:06,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 08:24:06,823 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 08:24:06,823 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 08:24:06,823 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 08:24:06,823 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 08:24:06,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 08:24:06,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 08:24:06,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 08:24:06,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 08:24:06 BoogieIcfgContainer [2018-12-01 08:24:06,828 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 08:24:06,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 08:24:06,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 08:24:06,828 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 08:24:06,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:23:53" (3/4) ... [2018-12-01 08:24:06,830 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 08:24:06,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 08:24:06,831 INFO L168 Benchmark]: Toolchain (without parser) took 14218.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.3 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -65.8 MB). Peak memory consumption was 307.5 MB. Max. memory is 11.5 GB. [2018-12-01 08:24:06,831 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:24:06,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-01 08:24:06,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.96 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-01 08:24:06,832 INFO L168 Benchmark]: Boogie Preprocessor took 17.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:24:06,832 INFO L168 Benchmark]: RCFGBuilder took 163.48 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-01 08:24:06,832 INFO L168 Benchmark]: BuchiAutomizer took 13736.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.5 MB). Peak memory consumption was 320.8 MB. Max. memory is 11.5 GB. [2018-12-01 08:24:06,832 INFO L168 Benchmark]: Witness Printer took 2.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 08:24:06,833 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.96 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 163.48 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13736.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.5 MB). Peak memory consumption was 320.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 9 terminating modules (3 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 11 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * aux-y_ref-aux and consists of 3 locations. One nondeterministic module has affine ranking function -1 * aux-y_ref-aux + aux-x_ref-aux and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.7s and 10 iterations. TraceHistogramMax:5. Analysis of lassos took 10.7s. Construction of modules took 0.2s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/6 HoareTripleCheckerStatistics: 63 SDtfs, 82 SDslu, 33 SDs, 0 SdLazy, 388 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital707 mio100 ax103 hnf100 lsp95 ukn32 mio100 lsp34 div100 bol100 ite100 ukn100 eq182 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 0 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...