./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/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_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/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-635dfa2 [2018-12-09 13:55:08,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 13:55:08,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 13:55:08,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 13:55:08,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 13:55:08,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 13:55:08,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 13:55:08,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 13:55:08,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 13:55:08,807 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 13:55:08,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 13:55:08,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 13:55:08,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 13:55:08,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 13:55:08,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 13:55:08,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 13:55:08,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 13:55:08,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 13:55:08,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 13:55:08,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 13:55:08,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 13:55:08,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 13:55:08,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 13:55:08,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 13:55:08,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 13:55:08,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 13:55:08,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 13:55:08,816 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 13:55:08,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 13:55:08,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 13:55:08,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 13:55:08,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 13:55:08,817 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 13:55:08,817 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 13:55:08,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 13:55:08,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 13:55:08,818 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 13:55:08,826 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 13:55:08,826 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 13:55:08,826 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 13:55:08,826 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 13:55:08,827 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 13:55:08,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 13:55:08,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 13:55:08,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 13:55:08,828 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 13:55:08,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 13:55:08,829 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 13:55:08,829 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 13:55:08,829 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 13:55:08,829 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_a623ee75-d26e-40a5-8818-0d83a7d8048a/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-12-09 13:55:08,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 13:55:08,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 13:55:08,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 13:55:08,859 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 13:55:08,859 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 13:55:08,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-12-09 13:55:08,900 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/data/b50aab52c/3c4663ee41fa418ba6ff3cd0e0437155/FLAG7553d7081 [2018-12-09 13:55:09,299 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 13:55:09,299 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-12-09 13:55:09,306 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/data/b50aab52c/3c4663ee41fa418ba6ff3cd0e0437155/FLAG7553d7081 [2018-12-09 13:55:09,315 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/data/b50aab52c/3c4663ee41fa418ba6ff3cd0e0437155 [2018-12-09 13:55:09,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 13:55:09,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 13:55:09,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 13:55:09,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 13:55:09,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 13:55:09,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eda5476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09, skipping insertion in model container [2018-12-09 13:55:09,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 13:55:09,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 13:55:09,482 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:55:09,488 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 13:55:09,554 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:55:09,575 INFO L195 MainTranslator]: Completed translation [2018-12-09 13:55:09,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09 WrapperNode [2018-12-09 13:55:09,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 13:55:09,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 13:55:09,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 13:55:09,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 13:55:09,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 13:55:09,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 13:55:09,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 13:55:09,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 13:55:09,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... [2018-12-09 13:55:09,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 13:55:09,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 13:55:09,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 13:55:09,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 13:55:09,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 13:55:09,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 13:55:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 13:55:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 13:55:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 13:55:09,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 13:55:09,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 13:55:09,793 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 13:55:09,793 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 13:55:09,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:55:09 BoogieIcfgContainer [2018-12-09 13:55:09,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 13:55:09,794 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 13:55:09,794 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 13:55:09,796 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 13:55:09,797 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 13:55:09,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:55:09" (1/3) ... [2018-12-09 13:55:09,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79f4c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:55:09, skipping insertion in model container [2018-12-09 13:55:09,798 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 13:55:09,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:55:09" (2/3) ... [2018-12-09 13:55:09,798 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79f4c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:55:09, skipping insertion in model container [2018-12-09 13:55:09,798 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 13:55:09,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:55:09" (3/3) ... [2018-12-09 13:55:09,799 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.15-alloca_true-termination_true-no-overflow.c.i [2018-12-09 13:55:09,828 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 13:55:09,829 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 13:55:09,829 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 13:55:09,829 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 13:55:09,829 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 13:55:09,829 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 13:55:09,829 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 13:55:09,829 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 13:55:09,829 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 13:55:09,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 13:55:09,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 13:55:09,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 13:55:09,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 13:55:09,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 13:55:09,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 13:55:09,853 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 13:55:09,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 13:55:09,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 13:55:09,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 13:55:09,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 13:55:09,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 13:55:09,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 13:55:09,859 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-12-09 13:55:09,859 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~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 11#L558-3true assume !true; 13#L558-4true [2018-12-09 13:55:09,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:09,862 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 13:55:09,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:09,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:09,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:09,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:09,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:09,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2018-12-09 13:55:09,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:09,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:09,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:55:09,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:55:09,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-09 13:55:09,983 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 13:55:09,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 13:55:09,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 13:55:09,992 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-09 13:55:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:55:09,996 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-09 13:55:09,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 13:55:09,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-12-09 13:55:09,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 13:55:10,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2018-12-09 13:55:10,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 13:55:10,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 13:55:10,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-12-09 13:55:10,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 13:55:10,001 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-09 13:55:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-12-09 13:55:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-09 13:55:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 13:55:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-09 13:55:10,017 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-09 13:55:10,017 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-09 13:55:10,017 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 13:55:10,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-12-09 13:55:10,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 13:55:10,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 13:55:10,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 13:55:10,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 13:55:10,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 13:55:10,018 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-12-09 13:55:10,018 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~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 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~mem12;havoc test_fun_#t~mem11; 33#L558-4 [2018-12-09 13:55:10,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-09 13:55:10,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:10,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:10,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:10,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2018-12-09 13:55:10,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:10,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:55:10,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:55:10,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:55:10,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 13:55:10,095 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 13:55:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:55:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:55:10,096 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-12-09 13:55:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:55:10,168 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-09 13:55:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:55:10,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-12-09 13:55:10,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 13:55:10,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2018-12-09 13:55:10,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 13:55:10,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 13:55:10,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-12-09 13:55:10,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 13:55:10,170 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-09 13:55:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-12-09 13:55:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-09 13:55:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 13:55:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-09 13:55:10,171 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-09 13:55:10,171 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-09 13:55:10,171 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 13:55:10,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-12-09 13:55:10,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 13:55:10,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 13:55:10,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 13:55:10,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 13:55:10,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-09 13:55:10,172 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-12-09 13:55:10,172 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~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 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~mem12;havoc test_fun_#t~mem11;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~mem12;havoc test_fun_#t~mem11; 65#L558-4 [2018-12-09 13:55:10,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-09 13:55:10,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:10,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:10,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:10,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:10,193 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2018-12-09 13:55:10,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:10,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:10,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:55:10,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:10,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2018-12-09 13:55:10,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:10,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:10,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:10,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:10,434 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2018-12-09 13:55:10,737 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-09 13:55:10,853 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-09 13:55:10,861 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 13:55:10,861 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 13:55:10,861 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 13:55:10,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 13:55:10,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 13:55:10,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 13:55:10,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 13:55:10,862 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 13:55:10,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-09 13:55:10,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 13:55:10,862 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 13:55:10,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:10,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,201 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-12-09 13:55:11,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:11,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 13:55:11,614 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 13:55:11,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:11,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:11,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:11,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:11,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:11,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:11,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:11,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:11,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:11,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:11,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:11,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:11,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:11,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:11,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:11,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:11,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:11,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:11,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:11,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:11,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:11,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:11,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:11,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:11,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:11,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:11,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:11,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:11,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:11,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:11,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:11,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:11,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:11,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:11,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:11,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:11,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:11,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:11,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:11,679 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 13:55:11,698 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 13:55:11,698 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 13:55:11,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 13:55:11,700 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 13:55:11,700 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 13:55:11,701 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, 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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2018-12-09 13:55:11,813 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-09 13:55:11,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 13:55:11,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 13:55:11,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:11,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:55:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:11,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:55:11,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:11,947 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-12-09 13:55:11,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:11,955 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-12-09 13:55:11,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:12,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,034 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-12-09 13:55:12,035 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:12,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,118 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-12-09 13:55:12,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,125 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-12-09 13:55:12,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:12,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,183 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-12-09 13:55:12,185 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-09 13:55:12,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 13:55:12,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,313 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-12-09 13:55:12,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,316 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-12-09 13:55:12,317 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:12,324 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:12,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,401 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-12-09 13:55:12,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,411 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-12-09 13:55:12,412 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:12,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,448 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-12-09 13:55:12,449 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:12,465 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:12,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 13:55:12,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,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, 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-12-09 13:55:12,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:12,566 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-12-09 13:55:12,567 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:13,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:13,194 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-12-09 13:55:13,195 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:13,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:13,788 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-12-09 13:55:13,788 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:14,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:14,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:14,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:14,458 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-12-09 13:55:14,459 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:15,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:15,055 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-12-09 13:55:15,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:15,058 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-12-09 13:55:15,058 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:15,065 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:15,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:15,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:15,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:15,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:15,792 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-12-09 13:55:15,792 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,115 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-12-09 13:55:16,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,120 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 13:55:16,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,128 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-12-09 13:55:16,128 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,181 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-12-09 13:55:16,182 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,212 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:16,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,402 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-12-09 13:55:16,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,410 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-12-09 13:55:16,411 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,450 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-12-09 13:55:16,451 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,473 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:16,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,635 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-12-09 13:55:16,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,639 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-12-09 13:55:16,639 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,668 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-12-09 13:55:16,669 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,687 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:16,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,960 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-12-09 13:55:16,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:16,965 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-12-09 13:55:16,966 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:16,972 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,031 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-09 13:55:17,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,045 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-12-09 13:55:17,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,049 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-12-09 13:55:17,050 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,097 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-12-09 13:55:17,097 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,139 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-12-09 13:55:17,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,144 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-12-09 13:55:17,144 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,151 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,185 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-12-09 13:55:17,186 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,222 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-12-09 13:55:17,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:17,224 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-12-09 13:55:17,225 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,230 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:17,248 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:17,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-09 13:55:17,351 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 1 variables, input treesize:99, output treesize:461 [2018-12-09 13:55:17,725 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2018-12-09 13:55:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:55:17,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-09 13:55:17,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-12-09 13:55:17,795 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-12-09 13:55:17,796 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-12-09 13:55:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 13:55:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-12-09 13:55:17,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-09 13:55:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 13:55:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-09 13:55:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 13:55:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-09 13:55:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 13:55:17,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-12-09 13:55:17,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 13:55:17,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2018-12-09 13:55:17,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-09 13:55:17,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-09 13:55:17,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-12-09 13:55:17,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 13:55:17,800 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 13:55:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-12-09 13:55:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-09 13:55:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 13:55:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-09 13:55:17,802 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-09 13:55:17,802 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-09 13:55:17,802 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 13:55:17,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-09 13:55:17,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 13:55:17,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 13:55:17,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 13:55:17,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 13:55:17,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 13:55:17,803 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~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 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~mem12;havoc test_fun_#t~mem11;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-12-09 13:55:17,803 INFO L796 eck$LassoCheckResult]: Loop: 304#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;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-12-09 13:55:17,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2018-12-09 13:55:17,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:17,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:55:17,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:55:17,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:55:17,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 13:55:17,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2018-12-09 13:55:17,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:17,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:55:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:55:17,877 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-09 13:55:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:55:17,884 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-09 13:55:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:55:17,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-12-09 13:55:17,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 13:55:17,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2018-12-09 13:55:17,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-09 13:55:17,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-09 13:55:17,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-12-09 13:55:17,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 13:55:17,886 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-09 13:55:17,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-12-09 13:55:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-09 13:55:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 13:55:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-09 13:55:17,887 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-09 13:55:17,887 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-09 13:55:17,887 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 13:55:17,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-12-09 13:55:17,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 13:55:17,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 13:55:17,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 13:55:17,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 13:55:17,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 13:55:17,888 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~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 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~mem12;havoc test_fun_#t~mem11;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-12-09 13:55:17,888 INFO L796 eck$LassoCheckResult]: Loop: 337#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;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-12-09 13:55:17,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:17,888 INFO L82 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2018-12-09 13:55:17,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:17,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:17,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:17,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:17,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2018-12-09 13:55:17,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:17,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:55:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:17,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2018-12-09 13:55:17,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:55:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:18,651 WARN L180 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 143 [2018-12-09 13:55:18,878 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-12-09 13:55:18,881 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 13:55:18,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 13:55:18,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 13:55:18,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 13:55:18,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 13:55:18,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 13:55:18,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 13:55:18,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 13:55:18,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-09 13:55:18,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 13:55:18,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 13:55:18,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:18,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:18,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:18,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,222 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2018-12-09 13:55:19,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 13:55:19,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 13:55:19,660 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 13:55:19,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:19,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:19,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:19,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 13:55:19,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 13:55:19,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 13:55:19,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,668 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 13:55:19,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,668 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 13:55:19,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,671 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 13:55:19,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,672 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 13:55:19,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 13:55:19,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 13:55:19,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 13:55:19,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 13:55:19,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 13:55:19,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 13:55:19,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 13:55:19,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 13:55:19,710 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 13:55:19,721 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 13:55:19,722 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 13:55:19,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 13:55:19,723 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-09 13:55:19,723 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 13:55:19,723 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-12-09 13:55:19,842 INFO L297 tatePredicateManager]: 39 out of 43 supporting invariants were superfluous and have been removed [2018-12-09 13:55:19,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 13:55:19,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:19,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:55:19,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:19,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:19,904 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-12-09 13:55:19,910 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-12-09 13:55:19,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:19,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:19,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:19,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-12-09 13:55:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:19,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:55:19,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:19,999 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-12-09 13:55:20,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,002 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-12-09 13:55:20,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,020 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-12-09 13:55:20,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-09 13:55:20,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-09 13:55:20,048 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-09 13:55:20,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,063 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-12-09 13:55:20,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,066 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-12-09 13:55:20,066 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,077 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-12-09 13:55:20,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,079 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-12-09 13:55:20,080 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,083 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,087 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,107 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-12-09 13:55:20,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,112 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-12-09 13:55:20,113 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,296 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-12-09 13:55:20,296 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,434 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-12-09 13:55:20,435 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,567 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 13:55:20,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,573 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-12-09 13:55:20,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,584 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-12-09 13:55:20,584 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-12-09 13:55:20,601 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:20,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,707 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-12-09 13:55:20,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,712 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 13:55:20,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,727 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-12-09 13:55:20,728 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,787 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-12-09 13:55:20,788 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-12-09 13:55:20,831 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 13:55:20,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,916 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-12-09 13:55:20,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,920 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-12-09 13:55:20,920 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:20,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:20,947 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-12-09 13:55:20,948 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 3 xjuncts. [2018-12-09 13:55:20,964 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 13:55:21,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:21,018 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-12-09 13:55:21,021 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 13:55:21,022 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:21,077 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-12-09 13:55:21,077 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:21,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 13:55:21,111 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-12-09 13:55:21,112 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 13:55:21,132 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:55:21,146 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:21,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 13:55:21,161 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 2 variables, input treesize:83, output treesize:86 [2018-12-09 13:55:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:55:21,185 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-12-09 13:55:21,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-12-09 13:55:21,243 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-12-09 13:55:21,244 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-12-09 13:55:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 13:55:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-09 13:55:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-09 13:55:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 13:55:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-09 13:55:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 13:55:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 13:55:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 13:55:21,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-12-09 13:55:21,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 13:55:21,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-12-09 13:55:21,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-09 13:55:21,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-09 13:55:21,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-09 13:55:21,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 13:55:21,246 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 13:55:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-09 13:55:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-09 13:55:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 13:55:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-09 13:55:21,247 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 13:55:21,247 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 13:55:21,247 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 13:55:21,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-12-09 13:55:21,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 13:55:21,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 13:55:21,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 13:55:21,248 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-12-09 13:55:21,248 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 13:55:21,248 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~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 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~mem12;havoc test_fun_#t~mem11;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~mem12;havoc test_fun_#t~mem11; 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~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 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~mem12;havoc test_fun_#t~mem11;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-12-09 13:55:21,248 INFO L796 eck$LassoCheckResult]: Loop: 610#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;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-12-09 13:55:21,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2018-12-09 13:55:21,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:21,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:21,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:55:21,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:55:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:55:21,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:55:21,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a623ee75-d26e-40a5-8818-0d83a7d8048a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:55:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:55:21,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:55:21,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:55:21,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:55:21,329 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-12-09 13:55:21,335 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-12-09 13:55:21,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 13:55:21,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:21,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:55:21,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-09 13:55:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:55:21,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:55:21,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 13:55:21,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 13:55:21,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:55:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2018-12-09 13:55:21,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:55:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:55:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:21,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:55:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:55:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:55:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:55:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:55:21,419 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-12-09 13:55:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:55:21,453 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-09 13:55:21,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 13:55:21,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-12-09 13:55:21,453 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 13:55:21,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-12-09 13:55:21,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 13:55:21,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 13:55:21,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 13:55:21,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 13:55:21,454 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 13:55:21,454 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 13:55:21,454 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 13:55:21,454 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 13:55:21,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 13:55:21,454 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 13:55:21,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 13:55:21,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 01:55:21 BoogieIcfgContainer [2018-12-09 13:55:21,459 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 13:55:21,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 13:55:21,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 13:55:21,459 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 13:55:21,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:55:09" (3/4) ... [2018-12-09 13:55:21,462 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 13:55:21,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 13:55:21,462 INFO L168 Benchmark]: Toolchain (without parser) took 12145.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2018-12-09 13:55:21,463 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:55:21,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 13:55:21,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 13:55:21,464 INFO L168 Benchmark]: Boogie Preprocessor took 17.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:55:21,464 INFO L168 Benchmark]: RCFGBuilder took 171.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 13:55:21,464 INFO L168 Benchmark]: BuchiAutomizer took 11664.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -71.8 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2018-12-09 13:55:21,465 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:55:21,466 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 171.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11664.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -71.8 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_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.6s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 7.4s. 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.0s 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: 3ms 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...