./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/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 e6c4332f1874752b59e29803328ba77ee4005585 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:10:14,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:10:14,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:10:14,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:10:14,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:10:14,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:10:14,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:10:14,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:10:14,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:10:14,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:10:14,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:10:14,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:10:14,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:10:14,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:10:14,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:10:14,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:10:14,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:10:14,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:10:14,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:10:14,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:10:14,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:10:14,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:10:14,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:10:14,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:10:14,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:10:14,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:10:14,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:10:14,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:10:14,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:10:14,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:10:14,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:10:14,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:10:14,779 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:10:14,779 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:10:14,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:10:14,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:10:14,781 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:10:14,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:10:14,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:10:14,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:10:14,794 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:10:14,794 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:10:14,795 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:10:14,795 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:10:14,795 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:10:14,795 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:10:14,795 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:10:14,795 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:10:14,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:10:14,796 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:10:14,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:10:14,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:10:14,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:10:14,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:10:14,796 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:10:14,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:10:14,797 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:10:14,797 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:10:14,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:10:14,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:10:14,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:10:14,797 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:10:14,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:10:14,798 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:10:14,798 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:10:14,798 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:10:14,799 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_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/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 -> e6c4332f1874752b59e29803328ba77ee4005585 [2018-11-28 11:10:14,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:10:14,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:10:14,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:10:14,833 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:10:14,833 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:10:14,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i [2018-11-28 11:10:14,875 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/data/6a1bd8fdb/3a7d3c8c9b514d41a734d8dc1da7e7ef/FLAGe67909b06 [2018-11-28 11:10:15,198 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:10:15,199 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i [2018-11-28 11:10:15,205 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/data/6a1bd8fdb/3a7d3c8c9b514d41a734d8dc1da7e7ef/FLAGe67909b06 [2018-11-28 11:10:15,213 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/bin-2019/uautomizer/data/6a1bd8fdb/3a7d3c8c9b514d41a734d8dc1da7e7ef [2018-11-28 11:10:15,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:10:15,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:10:15,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:10:15,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:10:15,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:10:15,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cedf8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15, skipping insertion in model container [2018-11-28 11:10:15,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:10:15,247 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:10:15,415 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:10:15,424 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:10:15,494 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:10:15,526 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:10:15,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15 WrapperNode [2018-11-28 11:10:15,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:10:15,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:10:15,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:10:15,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:10:15,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:10:15,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:10:15,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:10:15,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:10:15,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... [2018-11-28 11:10:15,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:10:15,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:10:15,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:10:15,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:10:15,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecda4d1c-4d39-4561-b4f7-e1fc3e088b40/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-28 11:10:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:10:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:10:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:10:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:10:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:10:15,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:10:15,876 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:10:15,876 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 11:10:15,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:15 BoogieIcfgContainer [2018-11-28 11:10:15,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:10:15,877 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:10:15,877 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:10:15,881 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:10:15,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:10:15,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:10:15" (1/3) ... [2018-11-28 11:10:15,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ce1d3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:10:15, skipping insertion in model container [2018-11-28 11:10:15,883 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:10:15,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:10:15" (2/3) ... [2018-11-28 11:10:15,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ce1d3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:10:15, skipping insertion in model container [2018-11-28 11:10:15,883 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:10:15,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:15" (3/3) ... [2018-11-28 11:10:15,885 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.06-alloca_true-termination_true-no-overflow.c.i [2018-11-28 11:10:15,928 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:10:15,928 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:10:15,928 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:10:15,929 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:10:15,929 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:10:15,929 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:10:15,929 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:10:15,929 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:10:15,929 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:10:15,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 11:10:15,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:10:15,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:15,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:15,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:10:15,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:15,965 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:10:15,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 11:10:15,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:10:15,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:15,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:15,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:10:15,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:15,974 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 4#L557-20true [2018-11-28 11:10:15,975 INFO L796 eck$LassoCheckResult]: Loop: 4#L557-20true call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 7#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 10#L557-3true test_fun_#t~short14 := test_fun_#t~short9; 13#L557-4true assume test_fun_#t~short14; 3#L557-9true test_fun_#t~short18 := test_fun_#t~short14; 5#L557-10true assume !test_fun_#t~short18; 8#L557-12true test_fun_#t~short20 := test_fun_#t~short18; 9#L557-13true assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 14#L557-15true test_fun_#t~short22 := test_fun_#t~short20; 16#L557-16true assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 4#L557-20true [2018-11-28 11:10:15,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:10:15,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:15,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2018-11-28 11:10:16,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:16,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:16,155 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-28 11:10:16,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:10:16,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:10:16,159 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:10:16,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:10:16,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:10:16,170 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-11-28 11:10:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:10:16,237 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-11-28 11:10:16,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:10:16,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-28 11:10:16,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-28 11:10:16,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2018-11-28 11:10:16,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 11:10:16,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 11:10:16,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-11-28 11:10:16,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:10:16,247 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-28 11:10:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-11-28 11:10:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-11-28 11:10:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 11:10:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-28 11:10:16,266 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 11:10:16,266 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 11:10:16,266 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:10:16,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-28 11:10:16,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 11:10:16,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:16,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:16,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:10:16,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:16,268 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 61#L557-20 [2018-11-28 11:10:16,268 INFO L796 eck$LassoCheckResult]: Loop: 61#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 62#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 64#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 67#L557-4 assume test_fun_#t~short14; 59#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 60#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 63#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 65#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 66#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 70#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 72#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 61#L557-20 [2018-11-28 11:10:16,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 11:10:16,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:16,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2018-11-28 11:10:16,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:16,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:16,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:16,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:16,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2018-11-28 11:10:16,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:16,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:16,720 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2018-11-28 11:10:17,075 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-28 11:10:17,204 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 11:10:17,212 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:10:17,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:10:17,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:10:17,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:10:17,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:10:17,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:10:17,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:10:17,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:10:17,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.06-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 11:10:17,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:10:17,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:10:17,232 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-28 11:10:17,236 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-28 11:10:17,238 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-28 11:10:17,239 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-28 11:10:17,240 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-28 11:10:17,242 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-28 11:10:17,243 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-28 11:10:17,245 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-28 11:10:17,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,256 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-28 11:10:17,258 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-28 11:10:17,260 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-28 11:10:17,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:17,264 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-28 11:10:17,266 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-28 11:10:17,267 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-28 11:10:17,268 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-28 11:10:17,270 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-28 11:10:17,271 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-28 11:10:17,273 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-28 11:10:17,278 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-28 11:10:17,279 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-28 11:10:17,677 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-28 11:10:17,765 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-28 11:10:18,148 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:10:18,152 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:10:18,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,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-28 11:10:18,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:10:18,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:10:18,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:10:18,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,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-28 11:10:18,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,278 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:10:18,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,279 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:10:18,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:18,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:10:18,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:10:18,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,292 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:10:18,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,293 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:10:18,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:18,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:10:18,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:18,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:18,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:18,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:18,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:18,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:18,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:10:18,331 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:10:18,331 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 11:10:18,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:10:18,335 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:10:18,335 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:10:18,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-11-28 11:10:18,472 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 11:10:18,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:10:18,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:18,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:10:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:18,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:10:18,618 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-28 11:10:18,620 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 11:10:18,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-28 11:10:18,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 73 states and 101 transitions. Complement of second has 12 states. [2018-11-28 11:10:18,772 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-28 11:10:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 11:10:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-28 11:10:18,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2018-11-28 11:10:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:10:18,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-28 11:10:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:10:18,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2018-11-28 11:10:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:10:18,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2018-11-28 11:10:18,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-28 11:10:18,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2018-11-28 11:10:18,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 11:10:18,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 11:10:18,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2018-11-28 11:10:18,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:10:18,778 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2018-11-28 11:10:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2018-11-28 11:10:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2018-11-28 11:10:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 11:10:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-11-28 11:10:18,782 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-28 11:10:18,782 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-11-28 11:10:18,782 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:10:18,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2018-11-28 11:10:18,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-28 11:10:18,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:18,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:18,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:10:18,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:18,783 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 409#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 410#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2018-11-28 11:10:18,783 INFO L796 eck$LassoCheckResult]: Loop: 393#L557-1 assume !test_fun_#t~short9; 400#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 407#L557-4 assume test_fun_#t~short14; 423#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 396#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 397#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 403#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 405#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 415#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 418#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 392#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2018-11-28 11:10:18,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 11:10:18,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:18,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:18,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:18,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:18,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2018-11-28 11:10:18,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:18,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:18,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:18,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:18,831 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-28 11:10:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:10:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:10:18,831 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:10:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:10:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:10:18,832 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-28 11:10:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:10:18,854 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2018-11-28 11:10:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:10:18,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2018-11-28 11:10:18,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-28 11:10:18,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2018-11-28 11:10:18,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 11:10:18,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 11:10:18,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2018-11-28 11:10:18,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:10:18,856 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-11-28 11:10:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2018-11-28 11:10:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2018-11-28 11:10:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:10:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2018-11-28 11:10:18,859 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-11-28 11:10:18,859 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-11-28 11:10:18,859 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:10:18,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2018-11-28 11:10:18,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:10:18,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:18,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:18,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:10:18,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:18,860 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 521#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2018-11-28 11:10:18,861 INFO L796 eck$LassoCheckResult]: Loop: 506#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 511#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 518#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 522#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 529#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 501#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 502#L557-10 assume !test_fun_#t~short18; 509#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 514#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 516#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 524#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 527#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 505#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2018-11-28 11:10:18,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-28 11:10:18,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:18,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:18,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2018-11-28 11:10:18,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:18,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:18,923 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-28 11:10:18,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:10:18,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:10:18,923 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:10:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:10:18,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:10:18,924 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 11:10:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:10:18,952 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-28 11:10:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:10:18,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2018-11-28 11:10:18,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 11:10:18,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2018-11-28 11:10:18,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 11:10:18,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 11:10:18,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2018-11-28 11:10:18,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:10:18,955 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2018-11-28 11:10:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2018-11-28 11:10:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-11-28 11:10:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 11:10:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-11-28 11:10:18,958 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-28 11:10:18,958 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-28 11:10:18,958 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:10:18,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2018-11-28 11:10:18,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 11:10:18,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:18,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:18,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:10:18,959 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:18,959 INFO L794 eck$LassoCheckResult]: Stem: 638#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 631#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 632#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2018-11-28 11:10:18,960 INFO L796 eck$LassoCheckResult]: Loop: 612#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 620#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 629#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 633#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 641#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 607#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 608#L557-10 assume !test_fun_#t~short18; 615#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 625#L557-13 assume !test_fun_#t~short20; 626#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 636#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 639#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 611#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2018-11-28 11:10:18,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2018-11-28 11:10:18,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:18,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:18,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 624883089, now seen corresponding path program 1 times [2018-11-28 11:10:18,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:18,998 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-28 11:10:18,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:10:18,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:10:18,998 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:10:18,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:10:18,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:10:18,999 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-28 11:10:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:10:19,028 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-28 11:10:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:10:19,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2018-11-28 11:10:19,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:10:19,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 39 states and 46 transitions. [2018-11-28 11:10:19,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 11:10:19,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 11:10:19,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-28 11:10:19,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:10:19,032 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 11:10:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-28 11:10:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 11:10:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:10:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-28 11:10:19,035 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 11:10:19,035 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 11:10:19,035 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:10:19,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-28 11:10:19,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:10:19,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:19,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:19,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:10:19,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:19,036 INFO L794 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 734#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 735#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2018-11-28 11:10:19,036 INFO L796 eck$LassoCheckResult]: Loop: 719#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 724#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 732#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 736#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 743#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 714#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 715#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 722#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 727#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 729#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 738#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 741#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 718#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2018-11-28 11:10:19,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:19,037 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2018-11-28 11:10:19,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:19,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:19,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:19,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2018-11-28 11:10:19,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:19,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:19,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:19,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:19,141 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-28 11:10:19,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:10:19,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:10:19,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:10:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:10:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:10:19,142 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-28 11:10:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:10:19,303 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-11-28 11:10:19,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:10:19,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 98 transitions. [2018-11-28 11:10:19,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-11-28 11:10:19,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 75 states and 82 transitions. [2018-11-28 11:10:19,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-28 11:10:19,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-28 11:10:19,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 82 transitions. [2018-11-28 11:10:19,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:10:19,306 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-28 11:10:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 82 transitions. [2018-11-28 11:10:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-11-28 11:10:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 11:10:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-28 11:10:19,308 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-28 11:10:19,308 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-28 11:10:19,309 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:10:19,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-11-28 11:10:19,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-28 11:10:19,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:19,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:19,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:10:19,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:19,310 INFO L794 eck$LassoCheckResult]: Stem: 894#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 886#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 887#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2018-11-28 11:10:19,310 INFO L796 eck$LassoCheckResult]: Loop: 871#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 876#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 884#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 897#L557-6 assume !test_fun_#t~short13; 898#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 866#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 867#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 874#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 880#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 882#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 892#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 895#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 870#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2018-11-28 11:10:19,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2018-11-28 11:10:19,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:19,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2018-11-28 11:10:19,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:19,344 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-28 11:10:19,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:10:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:10:19,345 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:10:19,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:10:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:10:19,345 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 11:10:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:10:19,395 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-28 11:10:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:10:19,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2018-11-28 11:10:19,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:10:19,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2018-11-28 11:10:19,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 11:10:19,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 11:10:19,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2018-11-28 11:10:19,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:10:19,398 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 11:10:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2018-11-28 11:10:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 11:10:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 11:10:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 11:10:19,400 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 11:10:19,400 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 11:10:19,400 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:10:19,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2018-11-28 11:10:19,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:10:19,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:10:19,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:10:19,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:10:19,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:10:19,402 INFO L794 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 990#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 991#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2018-11-28 11:10:19,402 INFO L796 eck$LassoCheckResult]: Loop: 975#L557-1 assume !test_fun_#t~short9; 980#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 988#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 992#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 998#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 970#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 971#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 978#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 983#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 985#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 993#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 996#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~short14;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~short22;havoc test_fun_#t~short18;havoc test_fun_#t~short13;havoc test_fun_#t~mem12;havoc test_fun_#t~mem16;havoc test_fun_#t~mem6;havoc test_fun_#t~short9;havoc test_fun_#t~mem15;havoc test_fun_#t~mem19;havoc test_fun_#t~mem21;havoc test_fun_#t~mem7;havoc test_fun_#t~short20;havoc test_fun_#t~mem8;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 974#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2018-11-28 11:10:19,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2018-11-28 11:10:19,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:19,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:19,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2018-11-28 11:10:19,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:19,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:10:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2018-11-28 11:10:19,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:10:19,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:10:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:10:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:10:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:10:19,738 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2018-11-28 11:10:19,914 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-11-28 11:10:20,198 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-28 11:10:20,584 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-28 11:10:20,587 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:10:20,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:10:20,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:10:20,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:10:20,588 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:10:20,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:10:20,588 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:10:20,588 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:10:20,588 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.06-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-28 11:10:20,588 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:10:20,588 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:10:20,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:21,269 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-11-28 11:10:21,603 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-28 11:10:21,604 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-28 11:10:21,605 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-28 11:10:21,607 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-28 11:10:21,608 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-28 11:10:21,610 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-28 11:10:21,611 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-28 11:10:21,612 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-28 11:10:21,614 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-28 11:10:21,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:21,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:10:21,631 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-28 11:10:21,632 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-28 11:10:21,634 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-28 11:10:21,635 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-28 11:10:21,637 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-28 11:10:21,638 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-28 11:10:21,639 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-28 11:10:21,641 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-28 11:10:21,642 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-28 11:10:21,643 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-28 11:10:21,645 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-28 11:10:21,647 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-28 11:10:21,648 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-28 11:10:21,649 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-28 11:10:21,651 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-28 11:10:21,653 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-28 11:10:21,657 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-28 11:10:22,158 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-28 11:10:22,343 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:10:22,343 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:10:22,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:22,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:22,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:22,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:22,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:22,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:22,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:22,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:22,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:22,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:22,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:10:22,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:10:22,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:22,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:10:22,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:10:22,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:10:22,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-28 11:10:22,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:10:22,364 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:10:22,364 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:10:22,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:10:22,373 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 11:10:22,373 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 11:10:22,442 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:10:22,484 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:10:22,484 INFO L444 ModelExtractionUtils]: 73 out of 76 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:10:22,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:10:22,487 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 11:10:22,488 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:10:22,488 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-28 11:10:22,675 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-28 11:10:22,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:10:22,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:10:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:22,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:10:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:10:22,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:10:22,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:22,846 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 73 [2018-11-28 11:10:22,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:22,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-11-28 11:10:22,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:22,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:22,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-28 11:10:22,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 76 [2018-11-28 11:10:23,013 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:10:23,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,048 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 100 [2018-11-28 11:10:23,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-28 11:10:23,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:10:23,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,139 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,189 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 57 [2018-11-28 11:10:23,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-11-28 11:10:23,196 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-11-28 11:10:23,237 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,266 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:10:23,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-11-28 11:10:23,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,286 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 52 treesize of output 39 [2018-11-28 11:10:23,286 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-28 11:10:23,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-28 11:10:23,301 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,306 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,312 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-11-28 11:10:23,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,327 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 37 treesize of output 26 [2018-11-28 11:10:23,327 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:10:23,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:10:23,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:10:23,340 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,345 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,352 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:10:23,389 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-28 11:10:23,389 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 3 variables, input treesize:78, output treesize:35 [2018-11-28 11:10:23,407 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-28 11:10:23,407 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-28 11:10:23,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 11:10:23,469 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 78 states and 87 transitions. Complement of second has 8 states. [2018-11-28 11:10:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:10:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 11:10:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-28 11:10:23,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 13 letters. [2018-11-28 11:10:23,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:10:23,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 16 letters. Loop has 13 letters. [2018-11-28 11:10:23,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:10:23,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 26 letters. [2018-11-28 11:10:23,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:10:23,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 87 transitions. [2018-11-28 11:10:23,472 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:10:23,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2018-11-28 11:10:23,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:10:23,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:10:23,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:10:23,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:10:23,473 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:10:23,475 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:10:23,475 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:10:23,475 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:10:23,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:10:23,475 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:10:23,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:10:23,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:10:23 BoogieIcfgContainer [2018-11-28 11:10:23,480 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:10:23,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:10:23,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:10:23,481 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:10:23,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:10:15" (3/4) ... [2018-11-28 11:10:23,484 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:10:23,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:10:23,485 INFO L168 Benchmark]: Toolchain (without parser) took 8269.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.2 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -397.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:10:23,485 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:10:23,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:10:23,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:10:23,487 INFO L168 Benchmark]: Boogie Preprocessor took 17.65 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:10:23,487 INFO L168 Benchmark]: RCFGBuilder took 301.05 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:10:23,487 INFO L168 Benchmark]: BuchiAutomizer took 7603.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -260.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:10:23,488 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:10:23,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.65 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 301.05 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7603.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -260.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 93 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 157 SDtfs, 165 SDslu, 254 SDs, 0 SdLazy, 260 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital693 mio100 ax103 hnf99 lsp73 ukn75 mio100 lsp30 div100 bol105 ite100 ukn100 eq170 hnf89 smp90 dnf228 smp74 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 124ms VariablesStem: 14 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...