./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/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_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/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-aa41828 [2018-11-23 07:37:24,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:37:24,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:37:24,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:37:24,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:37:24,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:37:24,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:37:24,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:37:24,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:37:24,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:37:24,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:37:24,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:37:24,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:37:24,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:37:24,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:37:24,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:37:24,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:37:24,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:37:24,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:37:24,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:37:24,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:37:24,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:37:24,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:37:24,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:37:24,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:37:24,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:37:24,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:37:24,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:37:24,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:37:24,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:37:24,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:37:24,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:37:24,038 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:37:24,038 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:37:24,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:37:24,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:37:24,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 07:37:24,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:37:24,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:37:24,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:37:24,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:37:24,050 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:37:24,050 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:37:24,050 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:37:24,050 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:37:24,051 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:37:24,051 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:37:24,051 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:37:24,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:37:24,051 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:37:24,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:37:24,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:37:24,051 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:37:24,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:37:24,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:37:24,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:37:24,052 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:37:24,052 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:37:24,052 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:37:24,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:37:24,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:37:24,053 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:37:24,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:37:24,053 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:37:24,053 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:37:24,054 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:37:24,054 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_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/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-11-23 07:37:24,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:37:24,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:37:24,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:37:24,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:37:24,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:37:24,086 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-23 07:37:24,121 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/data/57790cfca/97052931316a44179fd2053e38b6e3d3/FLAG9a2dc49e8 [2018-11-23 07:37:24,546 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:37:24,547 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-23 07:37:24,554 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/data/57790cfca/97052931316a44179fd2053e38b6e3d3/FLAG9a2dc49e8 [2018-11-23 07:37:24,562 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/bin-2019/uautomizer/data/57790cfca/97052931316a44179fd2053e38b6e3d3 [2018-11-23 07:37:24,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:37:24,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:37:24,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:37:24,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:37:24,567 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:37:24,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be9f308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24, skipping insertion in model container [2018-11-23 07:37:24,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:37:24,601 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:37:24,782 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:37:24,791 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:37:24,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:37:24,906 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:37:24,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24 WrapperNode [2018-11-23 07:37:24,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:37:24,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:37:24,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:37:24,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:37:24,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:37:24,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:37:24,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:37:24,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:37:24,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... [2018-11-23 07:37:24,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:37:24,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:37:24,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:37:24,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:37:24,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/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-11-23 07:37:25,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:37:25,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:37:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:37:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:37:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:37:25,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:37:25,165 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:37:25,165 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 07:37:25,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:37:25 BoogieIcfgContainer [2018-11-23 07:37:25,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:37:25,166 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:37:25,166 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:37:25,168 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:37:25,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:37:25,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:37:24" (1/3) ... [2018-11-23 07:37:25,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a02e6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:37:25, skipping insertion in model container [2018-11-23 07:37:25,170 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:37:25,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:24" (2/3) ... [2018-11-23 07:37:25,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a02e6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:37:25, skipping insertion in model container [2018-11-23 07:37:25,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:37:25,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:37:25" (3/3) ... [2018-11-23 07:37:25,172 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-23 07:37:25,213 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:37:25,213 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:37:25,214 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:37:25,214 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:37:25,214 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:37:25,214 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:37:25,214 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:37:25,214 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:37:25,214 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:37:25,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 07:37:25,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:37:25,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:25,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:25,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:37:25,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:37:25,242 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:37:25,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 07:37:25,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:37:25,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:25,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:25,244 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:37:25,244 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:37:25,250 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-11-23 07:37:25,251 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-11-23 07:37:25,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 07:37:25,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-23 07:37:25,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:25,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:37:25,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:37:25,378 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:37:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:37:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:37:25,389 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-23 07:37:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:37:25,393 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 07:37:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:37:25,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-23 07:37:25,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:37:25,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-23 07:37:25,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 07:37:25,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 07:37:25,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-23 07:37:25,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:37:25,399 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 07:37:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-23 07:37:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 07:37:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 07:37:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-23 07:37:25,415 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 07:37:25,416 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 07:37:25,416 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:37:25,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-23 07:37:25,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 07:37:25,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:25,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:25,417 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:37:25,417 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:37:25,417 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-11-23 07:37:25,417 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~mem6;havoc test_fun_#t~mem7; 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-11-23 07:37:25,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 07:37:25,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:25,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-23 07:37:25,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-23 07:37:25,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:25,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:37:25,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:37:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:37:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:37:25,680 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-23 07:37:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:37:25,721 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-23 07:37:25,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:37:25,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-23 07:37:25,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:37:25,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-23 07:37:25,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 07:37:25,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 07:37:25,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-23 07:37:25,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:37:25,725 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 07:37:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-23 07:37:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 07:37:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 07:37:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-23 07:37:25,726 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 07:37:25,726 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 07:37:25,726 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:37:25,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-23 07:37:25,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:37:25,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:25,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:25,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 07:37:25,728 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-23 07:37:25,728 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-11-23 07:37:25,728 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7; 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-11-23 07:37:25,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 07:37:25,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:25,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2018-11-23 07:37:25,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:25,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:25,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 1 times [2018-11-23 07:37:25,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:25,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:25,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:25,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:25,910 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-11-23 07:37:26,094 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-23 07:37:26,184 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:37:26,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:37:26,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:37:26,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:37:26,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:37:26,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:37:26,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:37:26,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:37:26,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-23 07:37:26,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:37:26,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:37:26,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,404 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-11-23 07:37:26,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,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-11-23 07:37:26,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-11-23 07:37:26,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:26,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:37:26,768 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:37:26,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:37:26,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:26,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:26,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:26,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:37:26,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:26,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:26,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:26,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:37:26,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:26,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:26,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:26,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,779 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-11-23 07:37:26,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:37:26,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:26,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:26,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:26,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,785 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-11-23 07:37:26,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,790 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-11-23 07:37:26,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,795 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-11-23 07:37:26,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,811 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-11-23 07:37:26,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,816 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-11-23 07:37:26,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,817 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:26,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,818 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:26,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,823 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-11-23 07:37:26,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,827 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-11-23 07:37:26,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,827 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:26,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,829 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:26,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,838 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-11-23 07:37:26,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:26,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-11-23 07:37:26,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:26,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:26,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:26,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:26,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:26,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:26,866 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:37:26,871 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:37:26,871 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:37:26,873 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:37:26,874 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:37:26,874 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:37:26,874 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-11-23 07:37:26,948 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-23 07:37:26,953 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:37:26,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:26,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:26,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:27,029 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-11-23 07:37:27,036 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-11-23 07:37:27,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:27,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,059 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-11-23 07:37:27,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 07:37:27,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:27,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:27,091 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-11-23 07:37:27,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,113 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-11-23 07:37:27,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,120 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-11-23 07:37:27,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:27,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:27,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,157 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-11-23 07:37:27,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,167 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-11-23 07:37:27,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:27,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:27,195 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-11-23 07:37:27,195 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:27,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:27,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:27,221 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:22 [2018-11-23 07:37:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:27,271 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-11-23 07:37:27,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-23 07:37:27,370 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-11-23 07:37:27,370 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-11-23 07:37:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 07:37:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-23 07:37:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-23 07:37:27,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-23 07:37:27,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-23 07:37:27,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:27,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-23 07:37:27,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:37:27,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 25 transitions. [2018-11-23 07:37:27,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 07:37:27,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 07:37:27,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-23 07:37:27,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:37:27,374 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 07:37:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-23 07:37:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 07:37:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 07:37:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 07:37:27,375 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 07:37:27,375 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 07:37:27,375 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:37:27,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-23 07:37:27,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:37:27,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:27,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:27,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:37:27,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-23 07:37:27,376 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~mem6;havoc test_fun_#t~mem7;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-11-23 07:37:27,376 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7; 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-11-23 07:37:27,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-23 07:37:27,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:27,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:27,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 2 times [2018-11-23 07:37:27,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:27,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:27,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:27,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:27,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 2 times [2018-11-23 07:37:27,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:27,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:27,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:27,882 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-23 07:37:27,969 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:37:27,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:37:27,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:37:27,969 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:37:27,969 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:37:27,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:37:27,969 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:37:27,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:37:27,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-23 07:37:27,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:37:27,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:37:27,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:27,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:27,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:27,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:27,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:27,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:27,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:28,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:37:28,478 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:37:28,478 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-11-23 07:37:28,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:28,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:28,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:28,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,480 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-11-23 07:37:28,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:28,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:28,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,486 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-11-23 07:37:28,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:28,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:28,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:28,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,488 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-11-23 07:37:28,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:28,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:28,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:28,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,490 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-11-23 07:37:28,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:28,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:28,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:28,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,491 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-11-23 07:37:28,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:28,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:28,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,494 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-11-23 07:37:28,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:28,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:28,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,510 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-11-23 07:37:28,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:28,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:28,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,516 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-11-23 07:37:28,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:28,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:28,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:28,524 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-11-23 07:37:28,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:28,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:28,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:28,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:28,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:28,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:28,539 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:37:28,561 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 07:37:28,561 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 07:37:28,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:37:28,562 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:37:28,563 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:37:28,563 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-11-23 07:37:28,649 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-23 07:37:28,650 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:37:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:28,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:28,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:28,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:28,691 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-11-23 07:37:28,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:28,695 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-11-23 07:37:28,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:28,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:28,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:28,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-23 07:37:28,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:28,757 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-11-23 07:37:28,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:28,762 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-11-23 07:37:28,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:28,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:28,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:28,792 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-11-23 07:37:28,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-23 07:37:28,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:28,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:28,817 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:38 [2018-11-23 07:37:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:28,846 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-11-23 07:37:28,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-23 07:37:29,019 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-11-23 07:37:29,019 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-11-23 07:37:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 07:37:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-11-23 07:37:29,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-23 07:37:29,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:29,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-23 07:37:29,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:29,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-23 07:37:29,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:29,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2018-11-23 07:37:29,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:37:29,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 51 transitions. [2018-11-23 07:37:29,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 07:37:29,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 07:37:29,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2018-11-23 07:37:29,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:37:29,025 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-23 07:37:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2018-11-23 07:37:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-11-23 07:37:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 07:37:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 07:37:29,027 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 07:37:29,027 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 07:37:29,027 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:37:29,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2018-11-23 07:37:29,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 07:37:29,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:29,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:29,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 07:37:29,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-23 07:37:29,029 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7;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-11-23 07:37:29,029 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7; 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-11-23 07:37:29,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2018-11-23 07:37:29,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:29,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:29,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:29,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:29,042 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 3 times [2018-11-23 07:37:29,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:29,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:29,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:29,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash -664221883, now seen corresponding path program 3 times [2018-11-23 07:37:29,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:29,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:29,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:29,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:29,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:29,937 WARN L180 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2018-11-23 07:37:30,024 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:37:30,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:37:30,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:37:30,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:37:30,024 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:37:30,024 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:37:30,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:37:30,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:37:30,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-23 07:37:30,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:37:30,025 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:37:30,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:30,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:37:30,495 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:37:30,495 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-11-23 07:37:30,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:30,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:30,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:30,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,496 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-11-23 07:37:30,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,498 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-11-23 07:37:30,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,501 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-11-23 07:37:30,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:30,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:30,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:30,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,503 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-11-23 07:37:30,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:30,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:30,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:30,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,504 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-11-23 07:37:30,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,507 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-11-23 07:37:30,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,509 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-11-23 07:37:30,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,512 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-11-23 07:37:30,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,517 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-11-23 07:37:30,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,521 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-11-23 07:37:30,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,522 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:30,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,523 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:30,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,526 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-11-23 07:37:30,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,528 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-11-23 07:37:30,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:30,531 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-11-23 07:37:30,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:30,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:30,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:30,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:30,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:30,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:30,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:37:30,550 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:37:30,550 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 07:37:30,550 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:37:30,551 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 07:37:30,551 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:37:30,551 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-11-23 07:37:30,630 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-23 07:37:30,631 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:37:30,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:30,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:30,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:30,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,705 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-11-23 07:37:30,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,708 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-11-23 07:37:30,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:30,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,725 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-11-23 07:37:30,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:30,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:30,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:30,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:50 [2018-11-23 07:37:30,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,806 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-11-23 07:37:30,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,809 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-11-23 07:37:30,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:30,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:30,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,829 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-11-23 07:37:30,831 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 07:37:30,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:30,833 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-11-23 07:37:30,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:30,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:30,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:30,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:61 [2018-11-23 07:37:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:30,876 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-11-23 07:37:30,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-23 07:37:31,001 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-11-23 07:37:31,001 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-11-23 07:37:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 07:37:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-23 07:37:31,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 8 letters. Loop has 7 letters. [2018-11-23 07:37:31,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:31,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-23 07:37:31,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:31,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 8 letters. Loop has 14 letters. [2018-11-23 07:37:31,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:31,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 81 transitions. [2018-11-23 07:37:31,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 07:37:31,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 66 transitions. [2018-11-23 07:37:31,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 07:37:31,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 07:37:31,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 66 transitions. [2018-11-23 07:37:31,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:37:31,006 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-23 07:37:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 66 transitions. [2018-11-23 07:37:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-11-23 07:37:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 07:37:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-23 07:37:31,009 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-23 07:37:31,009 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-23 07:37:31,009 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:37:31,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2018-11-23 07:37:31,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 07:37:31,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:31,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:31,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-23 07:37:31,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:37:31,010 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~mem6;havoc test_fun_#t~mem7;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-11-23 07:37:31,010 INFO L796 eck$LassoCheckResult]: Loop: 800#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;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-11-23 07:37:31,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907812, now seen corresponding path program 3 times [2018-11-23 07:37:31,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:31,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:31,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:31,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 1 times [2018-11-23 07:37:31,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:31,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:31,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:31,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 4 times [2018-11-23 07:37:31,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:31,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:31,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:31,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:31,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:31,342 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2018-11-23 07:37:31,406 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:37:31,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:37:31,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:37:31,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:37:31,406 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:37:31,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:37:31,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:37:31,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:37:31,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-11-23 07:37:31,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:37:31,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:37:31,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:31,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:37:31,886 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:37:31,886 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-11-23 07:37:31,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:31,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:31,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:31,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,888 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-11-23 07:37:31,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:31,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:31,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:31,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,889 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-11-23 07:37:31,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:31,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:31,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:31,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,891 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-11-23 07:37:31,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,893 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-11-23 07:37:31,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:31,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:31,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:31,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,895 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-11-23 07:37:31,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,897 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-11-23 07:37:31,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:31,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:31,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:31,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,898 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-11-23 07:37:31,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,900 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-11-23 07:37:31,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,903 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-11-23 07:37:31,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,912 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-11-23 07:37:31,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,915 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-11-23 07:37:31,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,925 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-11-23 07:37:31,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,925 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:31,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,926 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:31,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,928 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-11-23 07:37:31,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,931 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-11-23 07:37:31,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,934 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-11-23 07:37:31,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,937 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-11-23 07:37:31,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:31,940 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-11-23 07:37:31,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:31,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:31,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:31,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:31,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:31,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:31,958 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:37:31,966 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 07:37:31,966 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:37:31,967 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:37:31,967 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-23 07:37:31,968 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:37:31,968 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem6, 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 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 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)_4 - 1*ULTIMATE.start_test_fun_#t~mem7 >= 0, -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] [2018-11-23 07:37:32,023 INFO L297 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2018-11-23 07:37:32,028 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:37:32,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:32,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:32,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:32,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,078 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-11-23 07:37:32,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,083 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-11-23 07:37:32,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,108 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-11-23 07:37:32,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-23 07:37:32,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 07:37:32,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,126 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-23 07:37:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:32,133 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-11-23 07:37:32,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 07:37:32,159 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-11-23 07:37:32,159 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-11-23 07:37:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:37:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-23 07:37:32,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 07:37:32,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:32,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 07:37:32,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:32,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 07:37:32,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:32,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 76 transitions. [2018-11-23 07:37:32,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 07:37:32,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 57 states and 66 transitions. [2018-11-23 07:37:32,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 07:37:32,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 07:37:32,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2018-11-23 07:37:32,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:37:32,162 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 07:37:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2018-11-23 07:37:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-11-23 07:37:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 07:37:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-23 07:37:32,165 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 07:37:32,165 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 07:37:32,165 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:37:32,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2018-11-23 07:37:32,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 07:37:32,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:32,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:32,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 07:37:32,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-23 07:37:32,166 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7; 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~mem6;havoc test_fun_#t~mem7;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-11-23 07:37:32,166 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7; 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-11-23 07:37:32,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:32,167 INFO L82 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 4 times [2018-11-23 07:37:32,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:32,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:32,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:37:32,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7acd1b2-61bf-4c60-8d84-745a3208d6a1/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-11-23 07:37:32,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:37:32,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:37:32,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:37:32,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:32,273 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-11-23 07:37:32,275 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-11-23 07:37:32,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 07:37:32,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,282 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-11-23 07:37:32,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,285 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-11-23 07:37:32,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-23 07:37:32,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,332 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-11-23 07:37:32,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,336 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-11-23 07:37:32,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,363 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-11-23 07:37:32,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-23 07:37:32,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:32,385 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-11-23 07:37:32,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-11-23 07:37:32,422 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-11-23 07:37:32,424 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-11-23 07:37:32,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,449 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-11-23 07:37:32,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:32,463 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-11-23 07:37:32,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:32,481 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-11-23 07:37:32,484 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-11-23 07:37:32,484 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:32,494 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:44, output treesize:3 [2018-11-23 07:37:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:32,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:37:32,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-23 07:37:32,510 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:37:32,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:32,511 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 4 times [2018-11-23 07:37:32,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:32,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:32,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 07:37:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-23 07:37:32,593 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand 13 states. [2018-11-23 07:37:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:37:32,700 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 07:37:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:37:32,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 56 transitions. [2018-11-23 07:37:32,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:37:32,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 34 states and 38 transitions. [2018-11-23 07:37:32,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 07:37:32,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 07:37:32,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2018-11-23 07:37:32,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:37:32,702 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 07:37:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2018-11-23 07:37:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-11-23 07:37:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 07:37:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 07:37:32,703 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 07:37:32,703 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 07:37:32,703 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 07:37:32,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2018-11-23 07:37:32,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:37:32,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:32,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:32,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 07:37:32,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:37:32,704 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7; 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-11-23 07:37:32,704 INFO L796 eck$LassoCheckResult]: Loop: 1201#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;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-11-23 07:37:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:32,705 INFO L82 PathProgramCache]: Analyzing trace with hash -300113017, now seen corresponding path program 5 times [2018-11-23 07:37:32,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:32,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:32,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 2 times [2018-11-23 07:37:32,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:32,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:32,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 6 times [2018-11-23 07:37:32,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:32,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:32,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:32,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:34,379 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 168 DAG size of output: 156 [2018-11-23 07:37:34,589 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-23 07:37:34,591 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:37:34,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:37:34,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:37:34,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:37:34,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:37:34,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:37:34,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:37:34,592 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:37:34,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-23 07:37:34,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:37:34,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:37:34,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:34,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:35,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:37:35,081 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:37:35,081 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-11-23 07:37:35,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:35,082 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:35,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:35,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:35,083 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:35,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:35,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:35,085 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-11-23 07:37:35,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:35,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:35,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:35,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:35,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:35,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:35,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:35,088 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-11-23 07:37:35,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:35,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:35,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:35,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:35,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:35,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:35,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:35,090 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-11-23 07:37:35,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:35,091 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:35,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:35,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:35,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:35,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:35,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:35,094 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-11-23 07:37:35,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:35,094 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:35,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:35,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:35,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:35,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:35,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:35,097 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-11-23 07:37:35,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:35,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:35,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:35,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:35,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:35,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:35,105 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:37:35,116 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 07:37:35,116 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 07:37:35,116 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:37:35,117 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 07:37:35,117 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:37:35,117 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-11-23 07:37:35,184 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 07:37:35,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:35,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:35,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,218 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-11-23 07:37:35,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,228 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-11-23 07:37:35,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-23 07:37:35,245 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-11-23 07:37:35,247 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-11-23 07:37:35,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 07:37:35,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,263 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-11-23 07:37:35,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,266 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-11-23 07:37:35,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-23 07:37:35,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,289 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-11-23 07:37:35,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,292 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-11-23 07:37:35,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-23 07:37:35,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,332 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-11-23 07:37:35,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,335 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-11-23 07:37:35,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-23 07:37:35,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,360 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-11-23 07:37:35,362 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-11-23 07:37:35,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 07:37:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:35,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:35,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,400 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-11-23 07:37:35,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,413 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-11-23 07:37:35,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 07:37:35,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,438 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-11-23 07:37:35,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-11-23 07:37:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:35,459 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-11-23 07:37:35,459 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-23 07:37:35,487 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-11-23 07:37:35,487 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-11-23 07:37:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 07:37:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-23 07:37:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 07:37:35,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:35,488 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:37:35,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:35,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:35,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,524 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-11-23 07:37:35,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,537 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-11-23 07:37:35,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-23 07:37:35,557 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-11-23 07:37:35,558 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-11-23 07:37:35,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 07:37:35,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,574 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-11-23 07:37:35,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,576 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-11-23 07:37:35,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-23 07:37:35,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,590 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-11-23 07:37:35,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,592 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-11-23 07:37:35,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-23 07:37:35,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,634 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-11-23 07:37:35,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,636 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-11-23 07:37:35,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-23 07:37:35,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,661 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-11-23 07:37:35,662 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-11-23 07:37:35,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 07:37:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:35,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:35,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,698 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-11-23 07:37:35,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,709 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-11-23 07:37:35,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 07:37:35,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,743 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-11-23 07:37:35,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,752 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-11-23 07:37:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:35,762 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-11-23 07:37:35,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-23 07:37:35,783 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-11-23 07:37:35,784 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-11-23 07:37:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 07:37:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-23 07:37:35,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 07:37:35,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:35,784 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:37:35,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:35,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:35,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,816 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-11-23 07:37:35,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,826 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-11-23 07:37:35,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-23 07:37:35,841 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-11-23 07:37:35,842 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-11-23 07:37:35,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 07:37:35,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,857 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-11-23 07:37:35,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,859 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-11-23 07:37:35,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-23 07:37:35,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,875 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-11-23 07:37:35,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,877 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-11-23 07:37:35,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-23 07:37:35,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,925 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-11-23 07:37:35,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,930 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-11-23 07:37:35,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-23 07:37:35,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:35,969 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-11-23 07:37:35,972 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-11-23 07:37:35,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:35,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-23 07:37:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:36,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:36,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:36,018 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-11-23 07:37:36,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:36,022 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-11-23 07:37:36,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:36,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:36,045 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-11-23 07:37:36,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-23 07:37:36,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:36,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:37:36,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-11-23 07:37:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:36,066 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-11-23 07:37:36,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-23 07:37:36,155 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-11-23 07:37:36,156 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-11-23 07:37:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 07:37:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-11-23 07:37:36,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 07:37:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-23 07:37:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:36,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 07:37:36,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:36,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2018-11-23 07:37:36,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:37:36,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 42 states and 48 transitions. [2018-11-23 07:37:36,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 07:37:36,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 07:37:36,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-11-23 07:37:36,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:37:36,159 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 07:37:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-11-23 07:37:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 07:37:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 07:37:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 07:37:36,161 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 07:37:36,161 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 07:37:36,161 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 07:37:36,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2018-11-23 07:37:36,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 07:37:36,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:37:36,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:37:36,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 1, 1, 1, 1] [2018-11-23 07:37:36,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 07:37:36,162 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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7;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~mem6;havoc test_fun_#t~mem7; 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-11-23 07:37:36,162 INFO L796 eck$LassoCheckResult]: Loop: 1665#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;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-11-23 07:37:36,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash 883958124, now seen corresponding path program 7 times [2018-11-23 07:37:36,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:36,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:36,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:36,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:36,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 3 times [2018-11-23 07:37:36,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:36,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:36,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:36,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:37:36,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:36,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -919766745, now seen corresponding path program 8 times [2018-11-23 07:37:36,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:37:36,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:37:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:36,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:37:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:37:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:37:38,226 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 182 DAG size of output: 163 [2018-11-23 07:37:38,378 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-23 07:37:38,380 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:37:38,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:37:38,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:37:38,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:37:38,380 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:37:38,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:37:38,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:37:38,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:37:38,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration9_Lasso [2018-11-23 07:37:38,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:37:38,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:37:38,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,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-11-23 07:37:38,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:37:38,817 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:37:38,817 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:37:38,818 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-11-23 07:37:38,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,820 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-11-23 07:37:38,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:38,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:38,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:38,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,821 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-11-23 07:37:38,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:37:38,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:37:38,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:37:38,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,822 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-11-23 07:37:38,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,823 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-11-23 07:37:38,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,824 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-11-23 07:37:38,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,828 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-11-23 07:37:38,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,830 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-11-23 07:37:38,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,830 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:38,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,831 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:38,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,833 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-11-23 07:37:38,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,837 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-11-23 07:37:38,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,839 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-11-23 07:37:38,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,847 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-11-23 07:37:38,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,851 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-11-23 07:37:38,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,853 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-11-23 07:37:38,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 07:37:38,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,854 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:37:38,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:37:38,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-11-23 07:37:38,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:37:38,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:37:38,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:37:38,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:37:38,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:37:38,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 07:37:38,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:37:38,881 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 07:37:38,881 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:37:38,881 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:37:38,882 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 07:37:38,882 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:37:38,882 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-11-23 07:37:38,979 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-11-23 07:37:38,980 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:37:38,981 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 07:37:38,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:39,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,025 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-11-23 07:37:39,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,029 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-11-23 07:37:39,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:39,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,048 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-11-23 07:37:39,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:39,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:39,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:39,067 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-23 07:37:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:39,083 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-11-23 07:37:39,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 07:37:39,104 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-11-23 07:37:39,104 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-11-23 07:37:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:37:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-23 07:37:39,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-23 07:37:39,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:39,105 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:37:39,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:39,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,149 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-11-23 07:37:39,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,156 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-11-23 07:37:39,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:39,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,175 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-11-23 07:37:39,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:39,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:39,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:39,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-23 07:37:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:39,214 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-11-23 07:37:39,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 07:37:39,230 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-11-23 07:37:39,230 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-11-23 07:37:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:37:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-23 07:37:39,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-23 07:37:39,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:39,231 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:37:39,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:37:39,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,288 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-11-23 07:37:39,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,293 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-11-23 07:37:39,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:39,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:37:39,316 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-11-23 07:37:39,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:37:39,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:39,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 07:37:39,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-23 07:37:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:39,354 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-11-23 07:37:39,354 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 34 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 07:37:39,376 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-11-23 07:37:39,376 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-11-23 07:37:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 07:37:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 07:37:39,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-23 07:37:39,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:39,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 2 letters. [2018-11-23 07:37:39,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:39,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-23 07:37:39,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:37:39,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 47 transitions. [2018-11-23 07:37:39,378 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:37:39,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-23 07:37:39,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 07:37:39,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 07:37:39,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 07:37:39,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:37:39,378 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:37:39,379 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:37:39,379 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:37:39,379 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 07:37:39,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:37:39,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 07:37:39,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 07:37:39,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:37:39 BoogieIcfgContainer [2018-11-23 07:37:39,384 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:37:39,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:37:39,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:37:39,385 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:37:39,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:37:25" (3/4) ... [2018-11-23 07:37:39,388 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:37:39,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:37:39,388 INFO L168 Benchmark]: Toolchain (without parser) took 14824.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.7 MB). Free memory was 950.0 MB in the beginning and 997.3 MB in the end (delta: -47.3 MB). Peak memory consumption was 355.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:37:39,389 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:37:39,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -201.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:37:39,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:37:39,390 INFO L168 Benchmark]: Boogie Preprocessor took 20.07 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-11-23 07:37:39,390 INFO L168 Benchmark]: RCFGBuilder took 202.88 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:37:39,390 INFO L168 Benchmark]: BuchiAutomizer took 14218.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 997.3 MB in the end (delta: 125.6 MB). Peak memory consumption was 364.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:37:39,390 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 997.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:37:39,392 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -201.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.07 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 202.88 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14218.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 997.3 MB in the end (delta: 125.6 MB). Peak memory consumption was 364.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 997.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 -1 * aux-y_ref-aux + unknown-#memory_int-unknown[x_ref][x_ref] 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 14.1s and 10 iterations. TraceHistogramMax:5. Analysis of lassos took 11.2s. 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: 6ms 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...