./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/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 abee338f12eaa8176313da7ed567414f687b7fa7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:37:43,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:37:43,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:37:43,662 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:37:43,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:37:43,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:37:43,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:37:43,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:37:43,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:37:43,667 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:37:43,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:37:43,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:37:43,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:37:43,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:37:43,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:37:43,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:37:43,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:37:43,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:37:43,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:37:43,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:37:43,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:37:43,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:37:43,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:37:43,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:37:43,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:37:43,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:37:43,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:37:43,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:37:43,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:37:43,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:37:43,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:37:43,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:37:43,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:37:43,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:37:43,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:37:43,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:37:43,685 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 09:37:43,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:37:43,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:37:43,697 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:37:43,698 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:37:43,698 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:37:43,698 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 09:37:43,698 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 09:37:43,698 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 09:37:43,698 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 09:37:43,698 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 09:37:43,698 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 09:37:43,698 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:37:43,699 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 09:37:43,700 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:37:43,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 09:37:43,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:37:43,701 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:37:43,701 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 09:37:43,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:37:43,701 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:37:43,701 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 09:37:43,702 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 09:37:43,702 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_23fc5450-5b79-4c99-b70a-bff4483d8c92/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 -> abee338f12eaa8176313da7ed567414f687b7fa7 [2018-11-23 09:37:43,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:37:43,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:37:43,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:37:43,734 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:37:43,735 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:37:43,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-23 09:37:43,773 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/data/285de0b9b/2a748eef1357445ab4dba23def5b726e/FLAGff1c54ca6 [2018-11-23 09:37:44,207 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:37:44,208 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-23 09:37:44,218 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/data/285de0b9b/2a748eef1357445ab4dba23def5b726e/FLAGff1c54ca6 [2018-11-23 09:37:44,227 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/data/285de0b9b/2a748eef1357445ab4dba23def5b726e [2018-11-23 09:37:44,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:37:44,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:37:44,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:37:44,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:37:44,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:37:44,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7ad327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44, skipping insertion in model container [2018-11-23 09:37:44,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:37:44,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:37:44,456 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:37:44,464 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:37:44,530 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:37:44,562 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:37:44,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44 WrapperNode [2018-11-23 09:37:44,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:37:44,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:37:44,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:37:44,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:37:44,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:37:44,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:37:44,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:37:44,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:37:44,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... [2018-11-23 09:37:44,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:37:44,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:37:44,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:37:44,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:37:44,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:37:44,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:37:44,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:37:44,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:37:44,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:37:44,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:37:44,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:37:44,884 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:37:44,884 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 09:37:44,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:37:44 BoogieIcfgContainer [2018-11-23 09:37:44,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:37:44,885 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 09:37:44,885 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 09:37:44,888 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 09:37:44,889 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:37:44,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 09:37:44" (1/3) ... [2018-11-23 09:37:44,890 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@769e9234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:37:44, skipping insertion in model container [2018-11-23 09:37:44,890 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:37:44,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:44" (2/3) ... [2018-11-23 09:37:44,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@769e9234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:37:44, skipping insertion in model container [2018-11-23 09:37:44,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:37:44,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:37:44" (3/3) ... [2018-11-23 09:37:44,892 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-23 09:37:44,934 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:37:44,934 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 09:37:44,934 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 09:37:44,934 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 09:37:44,934 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:37:44,934 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:37:44,935 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 09:37:44,935 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:37:44,935 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 09:37:44,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 09:37:44,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 09:37:44,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:44,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:44,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:37:44,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 09:37:44,973 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 09:37:44,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-23 09:37:44,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 09:37:44,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:44,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:44,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:37:44,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 09:37:44,982 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 8#L559-4true [2018-11-23 09:37:44,983 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-4true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 14#L553-1true assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 18#L553-3true assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 9#L554true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 6#L559-3true assume !true; 8#L559-4true [2018-11-23 09:37:44,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:44,988 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 09:37:44,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:44,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash 35410170, now seen corresponding path program 1 times [2018-11-23 09:37:45,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:45,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:37:45,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 09:37:45,122 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 09:37:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:37:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:37:45,132 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-23 09:37:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:37:45,137 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-11-23 09:37:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:37:45,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-11-23 09:37:45,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 09:37:45,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2018-11-23 09:37:45,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 09:37:45,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 09:37:45,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2018-11-23 09:37:45,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:37:45,143 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-11-23 09:37:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2018-11-23 09:37:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 09:37:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 09:37:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-11-23 09:37:45,161 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-11-23 09:37:45,161 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2018-11-23 09:37:45,161 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 09:37:45,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2018-11-23 09:37:45,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 09:37:45,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:45,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:45,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:37:45,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:37:45,163 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 43#L559-4 [2018-11-23 09:37:45,163 INFO L796 eck$LassoCheckResult]: Loop: 43#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 49#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 50#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 51#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 45#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 44#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 43#L559-4 [2018-11-23 09:37:45,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 09:37:45,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:45,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2018-11-23 09:37:45,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:45,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:45,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:37:45,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:37:45,244 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 09:37:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:37:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:37:45,245 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-23 09:37:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:37:45,311 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-11-23 09:37:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:37:45,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-11-23 09:37:45,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 09:37:45,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2018-11-23 09:37:45,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 09:37:45,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 09:37:45,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-23 09:37:45,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:37:45,313 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 09:37:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-23 09:37:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-11-23 09:37:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:37:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-23 09:37:45,315 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 09:37:45,315 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 09:37:45,315 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 09:37:45,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-23 09:37:45,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-23 09:37:45,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:45,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:45,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:37:45,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:37:45,316 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 80#L559-4 [2018-11-23 09:37:45,316 INFO L796 eck$LassoCheckResult]: Loop: 80#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 86#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 87#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 89#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 84#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 85#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 80#L559-4 [2018-11-23 09:37:45,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 09:37:45,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:45,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2018-11-23 09:37:45,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:45,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:37:45,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:37:45,368 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 09:37:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:37:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:37:45,369 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-23 09:37:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:37:45,413 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-23 09:37:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:37:45,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-23 09:37:45,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 09:37:45,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 09:37:45,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 09:37:45,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 09:37:45,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 09:37:45,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:37:45,415 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 09:37:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 09:37:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 09:37:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:37:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-23 09:37:45,417 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 09:37:45,417 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 09:37:45,417 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 09:37:45,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-23 09:37:45,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 09:37:45,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:45,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:45,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:37:45,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 09:37:45,418 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 117#L559-4 [2018-11-23 09:37:45,419 INFO L796 eck$LassoCheckResult]: Loop: 117#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 121#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 122#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 126#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 123#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 124#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 128#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 117#L559-4 [2018-11-23 09:37:45,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 09:37:45,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2018-11-23 09:37:45,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:45,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:37:45,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23fc5450-5b79-4c99-b70a-bff4483d8c92/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:37:45,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:45,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:45,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:45,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-11-23 09:37:45,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:45,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 09:37:45,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:45,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:45,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:45,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-23 09:37:45,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:37:45,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 09:37:45,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2018-11-23 09:37:45,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 09:37:45,752 INFO L478 Elim1Store]: Elim1 did not use 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 09:37:45,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 09:37:45,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 09:37:45,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 09:37:45,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:45,788 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:61, output treesize:3 [2018-11-23 09:37:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:37:45,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 09:37:45,806 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 09:37:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 09:37:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 09:37:45,807 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-23 09:37:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:37:45,974 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-11-23 09:37:45,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 09:37:45,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-23 09:37:45,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 09:37:45,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2018-11-23 09:37:45,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 09:37:45,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 09:37:45,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-23 09:37:45,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:37:45,978 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 09:37:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-23 09:37:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 09:37:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 09:37:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-23 09:37:45,979 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 09:37:45,979 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 09:37:45,979 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 09:37:45,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-23 09:37:45,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 09:37:45,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:45,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:45,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:37:45,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 09:37:45,984 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 191#L559-4 [2018-11-23 09:37:45,984 INFO L796 eck$LassoCheckResult]: Loop: 191#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 195#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 196#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 200#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 201#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 192#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 193#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 199#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 191#L559-4 [2018-11-23 09:37:45,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-23 09:37:45,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:46,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:46,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2018-11-23 09:37:46,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:46,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:46,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:46,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2018-11-23 09:37:46,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:46,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:46,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:46,154 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-23 09:37:46,321 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:37:46,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:37:46,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:37:46,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:37:46,322 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:37:46,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:37:46,322 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:37:46,322 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:37:46,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-23 09:37:46,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:37:46,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:37:46,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:46,695 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:37:46,698 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:37:46,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:46,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:46,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:46,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:46,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:46,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:46,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:46,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:46,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:46,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:46,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:46,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:46,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:46,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:46,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:46,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:46,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:46,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:46,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:46,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:46,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:46,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:46,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,725 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:37:46,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,727 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:37:46,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:46,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,733 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:37:46,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,735 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:37:46,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:46,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:46,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:46,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:46,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:46,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:46,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:46,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:46,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:46,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:46,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:46,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:46,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:46,776 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:37:46,790 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 09:37:46,790 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 09:37:46,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:37:46,793 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:37:46,793 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:37:46,794 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-23 09:37:46,842 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 09:37:46,847 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:37:46,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:46,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:46,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:46,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-23 09:37:46,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 09:37:46,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:46,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:46,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 09:37:46,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 09:37:46,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:46,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:46,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:37:46,899 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:6 [2018-11-23 09:37:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:37:46,926 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 09:37:46,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-23 09:37:47,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 40 states and 53 transitions. Complement of second has 10 states. [2018-11-23 09:37:47,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 09:37:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:37:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 09:37:47,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-23 09:37:47,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:47,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 09:37:47,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:47,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-23 09:37:47,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:47,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-11-23 09:37:47,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 09:37:47,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2018-11-23 09:37:47,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 09:37:47,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 09:37:47,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2018-11-23 09:37:47,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:37:47,034 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2018-11-23 09:37:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2018-11-23 09:37:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-11-23 09:37:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 09:37:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-11-23 09:37:47,037 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-23 09:37:47,037 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-23 09:37:47,037 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 09:37:47,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2018-11-23 09:37:47,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 09:37:47,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:47,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:47,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 09:37:47,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2018-11-23 09:37:47,038 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 355#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2018-11-23 09:37:47,038 INFO L796 eck$LassoCheckResult]: Loop: 367#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 368#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 371#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 363#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 364#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 373#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 380#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 379#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 378#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 357#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2018-11-23 09:37:47,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 09:37:47,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:47,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:47,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:47,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:47,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:47,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:47,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2018-11-23 09:37:47,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:47,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:47,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:47,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:47,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:47,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2018-11-23 09:37:47,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:47,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:47,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:47,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:47,197 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-11-23 09:37:47,351 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-11-23 09:37:47,482 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-23 09:37:47,483 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:37:47,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:37:47,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:37:47,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:37:47,483 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:37:47,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:37:47,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:37:47,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:37:47,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-11-23 09:37:47,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:37:47,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:37:47,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,729 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-23 09:37:47,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:47,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:48,124 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:37:48,125 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:37:48,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:48,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:48,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:48,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:48,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:48,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:48,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:48,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:48,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:48,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:48,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:48,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:48,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:48,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:48,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:48,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:48,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:48,163 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:37:48,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:48,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:48,166 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:37:48,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:48,182 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:37:48,201 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 09:37:48,201 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 09:37:48,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:37:48,203 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:37:48,203 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:37:48,203 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-23 09:37:48,248 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 09:37:48,249 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:37:48,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:48,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:48,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:48,316 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 29 treesize of output 29 [2018-11-23 09:37:48,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 09:37:48,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:48,339 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 21 treesize of output 21 [2018-11-23 09:37:48,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 09:37:48,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 09:37:48,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:48,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:37:48,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:37:48,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-11-23 09:37:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:37:48,431 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-23 09:37:48,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 09:37:48,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 59 states and 83 transitions. Complement of second has 12 states. [2018-11-23 09:37:48,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 09:37:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 09:37:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 09:37:48,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-23 09:37:48,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:48,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-23 09:37:48,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:48,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 3 letters. Loop has 20 letters. [2018-11-23 09:37:48,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:48,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 83 transitions. [2018-11-23 09:37:48,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 09:37:48,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 50 states and 70 transitions. [2018-11-23 09:37:48,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 09:37:48,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 09:37:48,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 70 transitions. [2018-11-23 09:37:48,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:37:48,527 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 70 transitions. [2018-11-23 09:37:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 70 transitions. [2018-11-23 09:37:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 09:37:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 09:37:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2018-11-23 09:37:48,529 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2018-11-23 09:37:48,529 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2018-11-23 09:37:48,529 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 09:37:48,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2018-11-23 09:37:48,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 09:37:48,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:48,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:48,530 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:37:48,530 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:37:48,531 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 565#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 566#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 578#L553-1 assume !test_fun_#t~short6; 579#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 588#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 589#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 609#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 608#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 575#L555-1 [2018-11-23 09:37:48,531 INFO L796 eck$LassoCheckResult]: Loop: 575#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 574#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 575#L555-1 [2018-11-23 09:37:48,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:48,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1272523114, now seen corresponding path program 1 times [2018-11-23 09:37:48,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:48,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:37:48,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:37:48,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:37:48,560 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 09:37:48,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 1 times [2018-11-23 09:37:48,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:48,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:48,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:48,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:37:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:37:48,599 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-11-23 09:37:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:37:48,607 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2018-11-23 09:37:48,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:37:48,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2018-11-23 09:37:48,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 09:37:48,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 49 states and 63 transitions. [2018-11-23 09:37:48,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 09:37:48,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 09:37:48,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 63 transitions. [2018-11-23 09:37:48,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:37:48,610 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 09:37:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 63 transitions. [2018-11-23 09:37:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 09:37:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 09:37:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 09:37:48,613 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 09:37:48,613 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 09:37:48,613 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 09:37:48,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2018-11-23 09:37:48,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 09:37:48,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:48,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:48,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:37:48,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:37:48,614 INFO L794 eck$LassoCheckResult]: Stem: 680#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 672#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 673#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 691#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 703#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 701#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 699#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 697#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 694#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 689#L559-1 [2018-11-23 09:37:48,614 INFO L796 eck$LassoCheckResult]: Loop: 689#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 688#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 689#L559-1 [2018-11-23 09:37:48,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2018-11-23 09:37:48,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:48,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:48,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2018-11-23 09:37:48,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:48,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2018-11-23 09:37:48,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:48,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:48,955 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2018-11-23 09:37:49,005 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:37:49,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:37:49,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:37:49,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:37:49,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:37:49,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:37:49,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:37:49,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:37:49,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-23 09:37:49,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:37:49,006 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:37:49,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,366 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:37:49,366 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:37:49,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:49,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:49,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:49,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,417 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:37:49,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,417 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:37:49,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:49,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:49,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:49,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:49,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:49,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:49,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:49,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:49,456 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:37:49,466 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 09:37:49,466 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 09:37:49,466 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:37:49,467 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 09:37:49,467 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:37:49,467 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem11) = 1*ULTIMATE.start_test_fun_#t~mem11 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem11 >= 0] [2018-11-23 09:37:49,499 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 09:37:49,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:49,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:49,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:49,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:49,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 09:37:49,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:49,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:37:49,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:49,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:49,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:49,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-11-23 09:37:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:49,578 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 09:37:49,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 21 Second operand 3 states. [2018-11-23 09:37:49,595 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 101 states and 129 transitions. Complement of second has 5 states. [2018-11-23 09:37:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 09:37:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:37:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-23 09:37:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 09:37:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 09:37:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 09:37:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:49,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 129 transitions. [2018-11-23 09:37:49,601 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 09:37:49,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 92 states and 117 transitions. [2018-11-23 09:37:49,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 09:37:49,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 09:37:49,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2018-11-23 09:37:49,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:37:49,602 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2018-11-23 09:37:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2018-11-23 09:37:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2018-11-23 09:37:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 09:37:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-11-23 09:37:49,605 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-23 09:37:49,605 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-23 09:37:49,605 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 09:37:49,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 86 transitions. [2018-11-23 09:37:49,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 09:37:49,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:49,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:49,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:37:49,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:37:49,607 INFO L794 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 925#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 926#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 937#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 938#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 943#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 980#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 975#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 974#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 934#L555-1 [2018-11-23 09:37:49,607 INFO L796 eck$LassoCheckResult]: Loop: 934#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 933#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 934#L555-1 [2018-11-23 09:37:49,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1215264812, now seen corresponding path program 1 times [2018-11-23 09:37:49,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:49,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:49,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:49,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 2 times [2018-11-23 09:37:49,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:49,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:49,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:37:49,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:49,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -361619193, now seen corresponding path program 2 times [2018-11-23 09:37:49,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:49,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:49,860 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-23 09:37:49,921 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:37:49,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:37:49,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:37:49,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:37:49,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:37:49,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:37:49,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:37:49,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:37:49,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration9_Lasso [2018-11-23 09:37:49,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:37:49,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:37:49,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:49,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:37:50,273 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:37:50,274 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:37:50,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:50,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:50,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:50,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:50,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:50,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:50,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:50,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:50,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:50,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:50,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:50,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:50,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:50,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:50,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:50,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:50,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:50,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:50,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:50,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:50,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:37:50,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:50,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:50,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:50,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:37:50,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:37:50,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:37:50,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:37:50,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:37:50,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:37:50,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:37:50,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:37:50,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:37:50,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:37:50,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:37:50,300 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 09:37:50,301 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:37:50,301 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:37:50,302 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 09:37:50,302 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:37:50,302 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem9 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 >= 0] [2018-11-23 09:37:50,326 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 09:37:50,331 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:37:50,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:50,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:50,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:37:50,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:50,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-23 09:37:50,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:37:50,371 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 33 treesize of output 22 [2018-11-23 09:37:50,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:37:50,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:50,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:37:50,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-23 09:37:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:50,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 09:37:50,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 86 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-11-23 09:37:50,417 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 86 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 140 states and 174 transitions. Complement of second has 6 states. [2018-11-23 09:37:50,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-23 09:37:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:37:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 09:37:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 09:37:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-23 09:37:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 09:37:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:37:50,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 174 transitions. [2018-11-23 09:37:50,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 09:37:50,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 130 states and 163 transitions. [2018-11-23 09:37:50,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 09:37:50,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 09:37:50,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 163 transitions. [2018-11-23 09:37:50,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:37:50,423 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 163 transitions. [2018-11-23 09:37:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 163 transitions. [2018-11-23 09:37:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2018-11-23 09:37:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 09:37:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2018-11-23 09:37:50,428 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-11-23 09:37:50,428 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-11-23 09:37:50,428 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 09:37:50,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 141 transitions. [2018-11-23 09:37:50,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 09:37:50,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:50,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:50,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 09:37:50,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:37:50,429 INFO L794 eck$LassoCheckResult]: Stem: 1248#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1241#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 1242#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1261#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1252#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1260#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1264#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1246#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1247#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1259#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 1262#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1263#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1318#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1317#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1316#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1315#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1311#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1258#L559-1 [2018-11-23 09:37:50,430 INFO L796 eck$LassoCheckResult]: Loop: 1258#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1257#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1258#L559-1 [2018-11-23 09:37:50,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:50,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2018-11-23 09:37:50,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:50,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:50,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:50,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:37:50,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:37:50,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 09:37:50,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 09:37:50,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:50,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2018-11-23 09:37:50,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:50,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:50,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:50,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:37:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:37:50,485 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. cyclomatic complexity: 47 Second operand 5 states. [2018-11-23 09:37:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:37:50,520 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-11-23 09:37:50,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:37:50,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 105 transitions. [2018-11-23 09:37:50,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 09:37:50,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 24 states and 27 transitions. [2018-11-23 09:37:50,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 09:37:50,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 09:37:50,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-23 09:37:50,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:37:50,522 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 09:37:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-23 09:37:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 09:37:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:37:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 09:37:50,524 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 09:37:50,524 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 09:37:50,524 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 09:37:50,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-23 09:37:50,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 09:37:50,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:37:50,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:37:50,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 09:37:50,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 09:37:50,525 INFO L794 eck$LassoCheckResult]: Stem: 1451#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1449#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 1450#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1456#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1457#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1463#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1464#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1462#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1454#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1455#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1472#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1467#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 1461#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1458#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1459#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1460#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1469#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1468#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1465#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1453#L555-1 [2018-11-23 09:37:50,525 INFO L796 eck$LassoCheckResult]: Loop: 1453#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1452#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1453#L555-1 [2018-11-23 09:37:50,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:50,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2121929575, now seen corresponding path program 2 times [2018-11-23 09:37:50,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:50,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:50,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 09:37:50,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:37:50,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 09:37:50,564 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 09:37:50,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:50,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 3 times [2018-11-23 09:37:50,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:37:50,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:37:50,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:37:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:37:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:50,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:37:50,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:37:50,593 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-23 09:37:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:37:50,614 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 09:37:50,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:37:50,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-11-23 09:37:50,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 09:37:50,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-11-23 09:37:50,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 09:37:50,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 09:37:50,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 09:37:50,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:37:50,614 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:37:50,614 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:37:50,614 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:37:50,614 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 09:37:50,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:37:50,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 09:37:50,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 09:37:50,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 09:37:50 BoogieIcfgContainer [2018-11-23 09:37:50,618 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 09:37:50,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:37:50,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:37:50,619 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:37:50,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:37:44" (3/4) ... [2018-11-23 09:37:50,622 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:37:50,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:37:50,623 INFO L168 Benchmark]: Toolchain (without parser) took 6392.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -102.8 MB). Peak memory consumption was 128.4 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:50,623 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:37:50,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:50,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:50,624 INFO L168 Benchmark]: Boogie Preprocessor took 18.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:37:50,624 INFO L168 Benchmark]: RCFGBuilder took 274.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:50,624 INFO L168 Benchmark]: BuchiAutomizer took 5733.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.4 MB). Peak memory consumption was 135.6 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:50,624 INFO L168 Benchmark]: Witness Printer took 3.40 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-11-23 09:37:50,626 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 274.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5733.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.4 MB). Peak memory consumption was 135.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 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 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7fa4619b and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 12 iterations. TraceHistogramMax:5. Analysis of lassos took 4.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 59 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 110 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 115 SDtfs, 83 SDslu, 103 SDs, 0 SdLazy, 256 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax107 hnf99 lsp82 ukn69 mio100 lsp35 div100 bol103 ite100 ukn100 eq178 hnf89 smp96 dnf138 smp89 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...