./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-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_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/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 7464e7c5283b85fe14cc907bcd5d5339a700ef74 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:53:16,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:53:16,050 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:53:16,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:53:16,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:53:16,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:53:16,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:53:16,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:53:16,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:53:16,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:53:16,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:53:16,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:53:16,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:53:16,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:53:16,063 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:53:16,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:53:16,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:53:16,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:53:16,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:53:16,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:53:16,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:53:16,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:53:16,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:53:16,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:53:16,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:53:16,070 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:53:16,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:53:16,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:53:16,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:53:16,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:53:16,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:53:16,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:53:16,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:53:16,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:53:16,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:53:16,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:53:16,074 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 11:53:16,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:53:16,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:53:16,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:53:16,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:53:16,084 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:53:16,084 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 11:53:16,084 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 11:53:16,084 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 11:53:16,084 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 11:53:16,084 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 11:53:16,085 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 11:53:16,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:53:16,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 11:53:16,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:53:16,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:53:16,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 11:53:16,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 11:53:16,086 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 11:53:16,086 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:53:16,086 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 11:53:16,086 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:53:16,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 11:53:16,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:53:16,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:53:16,086 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 11:53:16,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:53:16,087 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:53:16,087 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 11:53:16,088 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 11:53:16,088 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_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/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 -> 7464e7c5283b85fe14cc907bcd5d5339a700ef74 [2018-11-23 11:53:16,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:53:16,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:53:16,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:53:16,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:53:16,126 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:53:16,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-23 11:53:16,169 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/data/69aed5c4f/e2f23f7fe5574f90a95e060a7ee809c2/FLAGfa4a4187c [2018-11-23 11:53:16,605 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:53:16,605 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-23 11:53:16,616 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/data/69aed5c4f/e2f23f7fe5574f90a95e060a7ee809c2/FLAGfa4a4187c [2018-11-23 11:53:16,627 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/bin-2019/uautomizer/data/69aed5c4f/e2f23f7fe5574f90a95e060a7ee809c2 [2018-11-23 11:53:16,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:53:16,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:53:16,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:53:16,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:53:16,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:53:16,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bab14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16, skipping insertion in model container [2018-11-23 11:53:16,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:53:16,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:53:16,850 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:53:16,858 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:53:16,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:53:16,953 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:53:16,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16 WrapperNode [2018-11-23 11:53:16,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:53:16,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:53:16,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:53:16,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:53:16,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:53:16,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:53:16,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:53:16,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:53:16,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... [2018-11-23 11:53:16,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:53:16,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:53:16,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:53:16,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:53:16,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/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 11:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:53:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:53:17,196 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:53:17,197 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:53:17,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:17 BoogieIcfgContainer [2018-11-23 11:53:17,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:53:17,197 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 11:53:17,198 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 11:53:17,200 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 11:53:17,201 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:53:17,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 11:53:16" (1/3) ... [2018-11-23 11:53:17,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56455d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:53:17, skipping insertion in model container [2018-11-23 11:53:17,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:53:17,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:16" (2/3) ... [2018-11-23 11:53:17,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56455d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:53:17, skipping insertion in model container [2018-11-23 11:53:17,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:53:17,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:17" (3/3) ... [2018-11-23 11:53:17,204 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-23 11:53:17,242 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:53:17,243 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 11:53:17,243 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 11:53:17,243 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 11:53:17,243 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:53:17,243 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:53:17,243 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 11:53:17,243 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:53:17,244 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 11:53:17,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 11:53:17,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 11:53:17,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:53:17,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:53:17,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:53:17,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:53:17,273 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 11:53:17,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 11:53:17,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 11:53:17,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:53:17,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:53:17,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:53:17,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 11:53:17,279 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L558-4true [2018-11-23 11:53:17,279 INFO L796 eck$LassoCheckResult]: Loop: 13#L558-4true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 14#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 11#L558-3true assume !true; 13#L558-4true [2018-11-23 11:53:17,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 11:53:17,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:17,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:17,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:17,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2018-11-23 11:53:17,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:17,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:17,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:17,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:17,417 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 11:53:17,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:17,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 11:53:17,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 11:53:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:53:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:53:17,431 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-23 11:53:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:17,435 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-23 11:53:17,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:53:17,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-23 11:53:17,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 11:53:17,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2018-11-23 11:53:17,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 11:53:17,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 11:53:17,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-11-23 11:53:17,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:53:17,444 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 11:53:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-11-23 11:53:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 11:53:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:53:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-23 11:53:17,462 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 11:53:17,462 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-23 11:53:17,463 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 11:53:17,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-23 11:53:17,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 11:53:17,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:53:17,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:53:17,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:53:17,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 11:53:17,464 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L558-4 [2018-11-23 11:53:17,464 INFO L796 eck$LassoCheckResult]: Loop: 33#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 37#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 38#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 36#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 33#L558-4 [2018-11-23 11:53:17,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 11:53:17,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:17,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:17,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:17,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2018-11-23 11:53:17,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:17,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:17,572 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 11:53:17,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:53:17,573 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 11:53:17,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:53:17,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:53:17,573 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-23 11:53:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:17,679 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-11-23 11:53:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:53:17,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-11-23 11:53:17,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 11:53:17,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2018-11-23 11:53:17,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 11:53:17,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 11:53:17,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-23 11:53:17,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:53:17,681 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 11:53:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-23 11:53:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-11-23 11:53:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:53:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-23 11:53:17,682 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 11:53:17,683 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 11:53:17,683 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 11:53:17,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-23 11:53:17,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 11:53:17,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:53:17,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:53:17,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 11:53:17,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-23 11:53:17,684 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 64#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 65#L558-4 [2018-11-23 11:53:17,684 INFO L796 eck$LassoCheckResult]: Loop: 65#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 69#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 70#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 72#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 67#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 68#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 71#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 65#L558-4 [2018-11-23 11:53:17,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:17,684 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 11:53:17,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:17,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:17,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2018-11-23 11:53:17,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2018-11-23 11:53:17,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:17,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:17,943 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2018-11-23 11:53:18,279 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-23 11:53:18,405 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-23 11:53:18,412 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:53:18,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:53:18,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:53:18,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:53:18,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:53:18,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:53:18,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:53:18,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:53:18,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-23 11:53:18,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:53:18,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:53:18,428 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 11:53:18,431 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 11:53:18,434 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 11:53:18,436 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 11:53:18,437 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 11:53:18,438 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 11:53:18,441 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 11:53:18,442 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 11:53:18,443 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 11:53:18,445 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 11:53:18,446 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 11:53:18,828 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-23 11:53:18,941 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-11-23 11:53:18,941 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 11:53:18,943 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 11:53:18,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:53:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:53:18,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:53:18,947 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 11:53:18,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:53:18,949 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 11:53:18,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:53:19,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:53:19,278 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:53:19,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:53:19,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:19,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:19,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:19,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:53:19,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:19,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:19,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:19,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,287 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 11:53:19,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:19,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:19,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:19,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:53:19,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:19,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:19,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:19,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,290 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 11:53:19,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:19,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:19,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:19,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,292 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 11:53:19,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:19,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:19,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,298 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 11:53:19,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:19,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:19,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:19,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,300 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 11:53:19,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:19,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:19,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:19,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,302 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 11:53:19,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:19,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:19,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,309 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 11:53:19,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:19,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:19,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,315 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 11:53:19,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:19,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:19,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:53:19,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:19,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:19,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:19,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 11:53:19,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:19,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:19,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:19,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:19,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:19,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:19,354 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:53:19,384 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 11:53:19,384 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 11:53:19,387 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:53:19,388 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:53:19,389 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:53:19,389 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, 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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 11:53:19,482 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-23 11:53:19,486 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:53:19,487 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:53:19,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:19,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:19,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:19,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 90 [2018-11-23 11:53:19,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 72 [2018-11-23 11:53:19,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:19,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,767 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 66 treesize of output 83 [2018-11-23 11:53:19,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:19,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 93 [2018-11-23 11:53:19,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,878 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 96 treesize of output 87 [2018-11-23 11:53:19,879 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:19,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:19,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 119 [2018-11-23 11:53:19,949 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-23 11:53:19,999 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:53:20,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,065 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 68 treesize of output 71 [2018-11-23 11:53:20,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,069 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 34 treesize of output 25 [2018-11-23 11:53:20,070 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:20,078 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:20,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 79 [2018-11-23 11:53:20,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,154 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 72 treesize of output 63 [2018-11-23 11:53:20,154 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:20,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,184 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 51 treesize of output 70 [2018-11-23 11:53:20,185 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:20,202 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:20,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:53:20,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 103 [2018-11-23 11:53:20,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 102 [2018-11-23 11:53:20,311 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:20,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:20,892 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 72 treesize of output 75 [2018-11-23 11:53:20,892 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:21,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:21,416 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 77 treesize of output 76 [2018-11-23 11:53:21,417 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:22,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:22,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:22,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:22,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2018-11-23 11:53:22,018 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:22,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:22,532 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 72 treesize of output 75 [2018-11-23 11:53:22,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:22,535 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 34 treesize of output 25 [2018-11-23 11:53:22,536 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:22,543 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:23,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 112 [2018-11-23 11:53:23,202 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:23,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2018-11-23 11:53:23,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,512 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:53:23,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,521 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 137 [2018-11-23 11:53:23,521 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:23,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 133 [2018-11-23 11:53:23,590 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:23,614 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:23,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,800 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 68 treesize of output 79 [2018-11-23 11:53:23,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:23,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 77 [2018-11-23 11:53:23,810 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:23,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 65 treesize of output 64 [2018-11-23 11:53:23,846 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:23,868 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:24,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 83 [2018-11-23 11:53:24,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,044 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 76 treesize of output 67 [2018-11-23 11:53:24,044 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 74 [2018-11-23 11:53:24,082 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,100 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:24,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-23 11:53:24,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,410 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 56 treesize of output 55 [2018-11-23 11:53:24,411 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,418 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,478 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-23 11:53:24,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2018-11-23 11:53:24,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2018-11-23 11:53:24,497 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,545 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 55 treesize of output 68 [2018-11-23 11:53:24,545 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,587 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 57 treesize of output 54 [2018-11-23 11:53:24,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,591 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 41 treesize of output 38 [2018-11-23 11:53:24,591 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,598 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2018-11-23 11:53:24,633 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-11-23 11:53:24,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:24,668 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 34 [2018-11-23 11:53:24,669 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,674 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:24,691 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:24,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-11-23 11:53:24,789 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 1 variables, input treesize:99, output treesize:461 [2018-11-23 11:53:25,195 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2018-11-23 11:53:25,197 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 11:53:25,199 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 11:53:25,199 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-23 11:53:25,272 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 8 states. Result 20 states and 27 transitions. Complement of second has 10 states. [2018-11-23 11:53:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 11:53:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:53:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-23 11:53:25,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-23 11:53:25,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:53:25,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-23 11:53:25,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:53:25,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-23 11:53:25,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:53:25,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-11-23 11:53:25,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:53:25,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2018-11-23 11:53:25,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 11:53:25,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 11:53:25,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-23 11:53:25,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:53:25,278 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 11:53:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-23 11:53:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 11:53:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:53:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-23 11:53:25,279 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 11:53:25,279 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 11:53:25,279 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 11:53:25,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-23 11:53:25,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:53:25,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:53:25,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:53:25,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:25,280 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:53:25,280 INFO L794 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 302#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 308#L557-1 assume !test_fun_#t~short10; 309#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 310#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 306#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 307#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 304#L558-1 [2018-11-23 11:53:25,280 INFO L796 eck$LassoCheckResult]: Loop: 304#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 305#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 304#L558-1 [2018-11-23 11:53:25,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2018-11-23 11:53:25,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:25,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:53:25,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:25,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:53:25,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:53:25,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2018-11-23 11:53:25,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:25,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:25,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:53:25,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:53:25,368 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 11:53:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:25,373 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 11:53:25,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:53:25,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-23 11:53:25,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:53:25,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2018-11-23 11:53:25,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 11:53:25,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-23 11:53:25,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-23 11:53:25,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:53:25,375 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 11:53:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-23 11:53:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:53:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:53:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 11:53:25,376 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 11:53:25,376 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 11:53:25,376 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 11:53:25,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-23 11:53:25,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:53:25,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:53:25,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:53:25,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:25,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:53:25,377 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 334#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 335#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 341#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 342#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 343#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 339#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 340#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 337#L558-1 [2018-11-23 11:53:25,377 INFO L796 eck$LassoCheckResult]: Loop: 337#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 338#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 337#L558-1 [2018-11-23 11:53:25,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2018-11-23 11:53:25,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:25,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2018-11-23 11:53:25,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:25,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:25,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:25,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:25,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2018-11-23 11:53:25,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:25,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:26,039 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 143 [2018-11-23 11:53:26,254 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-23 11:53:26,257 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:53:26,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:53:26,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:53:26,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:53:26,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:53:26,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:53:26,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:53:26,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:53:26,257 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-23 11:53:26,257 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:53:26,258 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:53:26,261 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 11:53:26,262 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 11:53:26,263 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 11:53:26,265 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 11:53:26,597 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2018-11-23 11:53:26,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:53:26,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 11:53:26,688 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 11:53:26,689 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 11:53:26,690 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 11:53:26,691 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 11:53:26,692 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 11:53:26,693 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 11:53:26,694 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 11:53:26,696 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 11:53:26,697 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 11:53:26,698 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 11:53:26,699 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 11:53:27,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:53:27,057 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:53:27,057 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 11:53:27,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:27,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:27,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:27,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,059 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 11:53:27,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:53:27,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:53:27,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:53:27,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,061 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 11:53:27,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,063 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 11:53:27,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,066 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 11:53:27,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,066 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:53:27,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,067 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:53:27,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,071 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 11:53:27,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:53:27,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,072 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:53:27,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,075 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 11:53:27,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,080 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 11:53:27,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,086 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 11:53:27,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,100 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 11:53:27,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,103 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 11:53:27,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:53:27,106 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 11:53:27,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:53:27,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:53:27,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:53:27,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:53:27,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:53:27,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:53:27,131 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:53:27,149 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 11:53:27,149 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 11:53:27,149 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:53:27,150 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-23 11:53:27,152 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:53:27,152 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem12, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*ULTIMATE.start_test_fun_#t~mem12 + 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 [-1*ULTIMATE.start_test_fun_#t~mem11 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 >= 0, -1*ULTIMATE.start_test_fun_#t~mem12 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 >= 0] [2018-11-23 11:53:27,299 INFO L297 tatePredicateManager]: 39 out of 43 supporting invariants were superfluous and have been removed [2018-11-23 11:53:27,304 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:53:27,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:27,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:27,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-11-23 11:53:27,375 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 22 [2018-11-23 11:53:27,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:27,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-11-23 11:53:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:27,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:27,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 11:53:27,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,475 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 23 treesize of output 16 [2018-11-23 11:53:27,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 11:53:27,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,503 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 11:53:27,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,530 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 11:53:27,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-23 11:53:27,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-11-23 11:53:27,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,553 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-23 11:53:27,553 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 11:53:27,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,572 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 36 treesize of output 27 [2018-11-23 11:53:27,572 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,576 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 84 [2018-11-23 11:53:27,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,604 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 69 treesize of output 62 [2018-11-23 11:53:27,605 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,754 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 46 treesize of output 53 [2018-11-23 11:53:27,754 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:27,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:27,880 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 58 treesize of output 61 [2018-11-23 11:53:27,880 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,016 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:53:28,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2018-11-23 11:53:28,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,033 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 33 treesize of output 51 [2018-11-23 11:53:28,034 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-11-23 11:53:28,050 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:28,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 92 [2018-11-23 11:53:28,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,158 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:53:28,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,175 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 111 [2018-11-23 11:53:28,176 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 101 [2018-11-23 11:53:28,234 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-11-23 11:53:28,283 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:53:28,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 57 [2018-11-23 11:53:28,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,363 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 46 treesize of output 37 [2018-11-23 11:53:28,364 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,391 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 29 treesize of output 47 [2018-11-23 11:53:28,392 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-11-23 11:53:28,409 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:53:28,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 75 [2018-11-23 11:53:28,473 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 11:53:28,473 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 32 treesize of output 31 [2018-11-23 11:53:28,551 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:53:28,578 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 31 treesize of output 32 [2018-11-23 11:53:28,579 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,608 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:53:28,626 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:53:28,644 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 2 variables, input treesize:83, output treesize:86 [2018-11-23 11:53:28,672 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 11:53:28,673 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-23 11:53:28,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-23 11:53:28,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 26 states and 31 transitions. Complement of second has 6 states. [2018-11-23 11:53:28,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 11:53:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:53:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-23 11:53:28,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 11:53:28,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:53:28,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 11:53:28,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:53:28,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 11:53:28,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:53:28,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-23 11:53:28,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:53:28,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-11-23 11:53:28,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 11:53:28,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-23 11:53:28,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-23 11:53:28,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 11:53:28,733 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 11:53:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-23 11:53:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-23 11:53:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:53:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 11:53:28,735 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 11:53:28,735 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 11:53:28,735 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 11:53:28,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-23 11:53:28,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:53:28,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:53:28,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:53:28,735 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 11:53:28,736 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:53:28,736 INFO L794 eck$LassoCheckResult]: Stem: 609#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 607#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 608#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 614#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 615#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 617#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 612#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 613#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 616#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 618#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 619#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 623#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 622#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 621#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 620#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 610#L558-1 [2018-11-23 11:53:28,736 INFO L796 eck$LassoCheckResult]: Loop: 610#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 611#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 610#L558-1 [2018-11-23 11:53:28,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2018-11-23 11:53:28,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:28,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:28,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:53:28,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:28,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cf25f7f5-c8b9-4e25-a9dd-d9997b249bc3/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 11:53:28,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:28,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:28,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:28,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:28,895 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 26 treesize of output 26 [2018-11-23 11:53:28,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 18 [2018-11-23 11:53:28,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:53:28,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:53:28,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 11:53:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:53:28,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:28,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:53:28,939 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 11:53:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2018-11-23 11:53:28,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:28,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:28,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:53:29,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:53:29,007 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-23 11:53:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:29,052 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:53:29,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:53:29,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-11-23 11:53:29,053 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:53:29,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-11-23 11:53:29,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 11:53:29,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 11:53:29,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 11:53:29,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:53:29,053 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:53:29,053 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:53:29,053 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:53:29,053 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 11:53:29,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:53:29,053 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:53:29,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 11:53:29,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 11:53:29 BoogieIcfgContainer [2018-11-23 11:53:29,059 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 11:53:29,059 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:53:29,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:53:29,059 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:53:29,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:17" (3/4) ... [2018-11-23 11:53:29,064 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 11:53:29,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:53:29,064 INFO L168 Benchmark]: Toolchain (without parser) took 12435.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.2 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -206.9 MB). Peak memory consumption was 67.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:53:29,065 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:53:29,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 11:53:29,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.41 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:53:29,066 INFO L168 Benchmark]: Boogie Preprocessor took 14.44 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 11:53:29,066 INFO L168 Benchmark]: RCFGBuilder took 203.55 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:53:29,066 INFO L168 Benchmark]: BuchiAutomizer took 11861.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.9 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. [2018-11-23 11:53:29,066 INFO L168 Benchmark]: Witness Printer took 4.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:53:29,072 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.41 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.44 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 203.55 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11861.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.9 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * aux-z_ref-aux + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 7.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 41 SDtfs, 26 SDslu, 31 SDs, 0 SdLazy, 93 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1189 mio100 ax102 hnf100 lsp96 ukn31 mio100 lsp33 div100 bol100 ite100 ukn100 eq191 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...