./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/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 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:35,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:35,949 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:35,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:35,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:35,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:35,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:35,966 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:35,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:35,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:35,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:35,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:35,973 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:35,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:35,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:35,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:35,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:35,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:35,981 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:35,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:35,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:35,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:35,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:35,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:35,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:35,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:35,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:35,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:35,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:35,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:35,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:35,997 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:35,997 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:35,997 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:36,000 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:36,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:36,001 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:36,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:36,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:36,020 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:36,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:36,020 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:36,021 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:36,021 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:36,021 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:36,021 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:36,021 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:36,021 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:36,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:36,021 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:36,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:36,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:36,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:36,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:36,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:36,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:36,022 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:36,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:36,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:36,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:36,023 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:36,023 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:36,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:36,026 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:36,026 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:36,026 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_34b6d794-7cf5-42d3-88be-11f59286f7be/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 -> 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be [2018-10-27 06:06:36,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:36,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:36,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:36,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:36,064 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:36,065 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-10-27 06:06:36,110 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/data/8b2d9faf6/c66e91e689cc480b8daa20c310953699/FLAG8f01638d3 [2018-10-27 06:06:36,521 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:36,523 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/sv-benchmarks/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-10-27 06:06:36,531 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/data/8b2d9faf6/c66e91e689cc480b8daa20c310953699/FLAG8f01638d3 [2018-10-27 06:06:36,542 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/data/8b2d9faf6/c66e91e689cc480b8daa20c310953699 [2018-10-27 06:06:36,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:36,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:36,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:36,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:36,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:36,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:36,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36, skipping insertion in model container [2018-10-27 06:06:36,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:36,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:36,592 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:36,818 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:36,826 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:36,860 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:36,895 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:36,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36 WrapperNode [2018-10-27 06:06:36,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:36,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:36,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:36,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:36,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:36,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:36,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:36,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:36,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:36,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:36,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:36,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:37,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:37,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:37,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:37,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:37,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... [2018-10-27 06:06:37,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:37,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:37,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:37,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:37,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/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-10-27 06:06:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:37,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:37,526 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:37,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:37 BoogieIcfgContainer [2018-10-27 06:06:37,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:37,527 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:37,527 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:37,530 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:37,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:37,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:36" (1/3) ... [2018-10-27 06:06:37,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e4bbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:37, skipping insertion in model container [2018-10-27 06:06:37,533 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:37,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:36" (2/3) ... [2018-10-27 06:06:37,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18e4bbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:37, skipping insertion in model container [2018-10-27 06:06:37,534 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:37,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:37" (3/3) ... [2018-10-27 06:06:37,535 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-alloca_true-termination.c.i [2018-10-27 06:06:37,590 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:37,591 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:37,591 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:37,591 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:37,591 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:37,592 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:37,592 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:37,592 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:37,592 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:37,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-10-27 06:06:37,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:06:37,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:37,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:37,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:37,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:37,637 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:37,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-10-27 06:06:37,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:06:37,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:37,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:37,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:37,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:37,648 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 5#L559-2true [2018-10-27 06:06:37,649 INFO L795 eck$LassoCheckResult]: Loop: 5#L559-2true assume true; 16#L550-1true SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 3#L550-2true main_#t~short6 := main_#t~mem4 != 0; 4#L550-3true assume !main_#t~short6; 8#L550-7true assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 29#L551true SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 32#L551-1true assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 17#L559true assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 33#L560true SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 35#L560-1true SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 18#L560-2true havoc main_#t~mem13; 5#L559-2true [2018-10-27 06:06:37,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:37,656 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:06:37,658 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:37,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:37,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:37,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:37,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:37,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1857969119, now seen corresponding path program 1 times [2018-10-27 06:06:37,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:37,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:37,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:37,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:37,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:37,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:37,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:37,839 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:37,850 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-10-27 06:06:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:37,932 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-10-27 06:06:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:37,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-10-27 06:06:37,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:06:37,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 32 transitions. [2018-10-27 06:06:37,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:06:37,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:06:37,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2018-10-27 06:06:37,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:37,942 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-27 06:06:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2018-10-27 06:06:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-27 06:06:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 06:06:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-10-27 06:06:37,966 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-27 06:06:37,966 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-27 06:06:37,966 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:37,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2018-10-27 06:06:37,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:06:37,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:37,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:37,968 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:37,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:37,968 INFO L793 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 79#L559-2 [2018-10-27 06:06:37,968 INFO L795 eck$LassoCheckResult]: Loop: 79#L559-2 assume true; 80#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 76#L550-2 main_#t~short6 := main_#t~mem4 != 0; 77#L550-3 assume main_#t~short6; 78#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 81#L550-5 main_#t~short6 := main_#t~mem5 > 0; 82#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 83#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 102#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 88#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 89#L556 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 95#L556-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 96#L556-2 havoc main_#t~mem11; 79#L559-2 [2018-10-27 06:06:37,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:06:37,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:37,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:37,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:37,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1347069716, now seen corresponding path program 1 times [2018-10-27 06:06:37,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash 330976914, now seen corresponding path program 1 times [2018-10-27 06:06:38,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:38,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:38,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:38,371 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2018-10-27 06:06:38,628 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-27 06:06:38,710 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:38,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:38,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:38,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:38,712 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:38,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:38,712 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:38,712 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:38,712 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:06:38,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:38,713 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:38,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:38,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:38,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:38,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:38,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,380 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-10-27 06:06:39,538 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-10-27 06:06:39,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:39,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-10-27 06:06:39,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:40,081 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:40,086 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:40,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,105 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-10-27 06:06:40,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,108 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-10-27 06:06:40,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,120 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-10-27 06:06:40,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:40,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,161 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-10-27 06:06:40,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,182 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-10-27 06:06:40,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,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-10-27 06:06:40,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:40,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:40,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:40,225 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-10-27 06:06:40,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:40,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:40,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:40,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:40,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:40,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:40,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:40,231 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:40,234 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:40,234 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:40,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:40,237 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:06:40,237 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:40,237 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2018-10-27 06:06:40,305 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:40,310 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:40,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:40,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:40,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:40,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:40,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:06:40,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:06:40,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:40,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:40,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:40,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:06:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:40,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:40,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-10-27 06:06:40,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 70 states and 77 transitions. Complement of second has 13 states. [2018-10-27 06:06:40,705 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-10-27 06:06:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-10-27 06:06:40,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 2 letters. Loop has 13 letters. [2018-10-27 06:06:40,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:40,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 13 letters. [2018-10-27 06:06:40,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:40,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 2 letters. Loop has 26 letters. [2018-10-27 06:06:40,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:40,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 77 transitions. [2018-10-27 06:06:40,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:06:40,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 61 states and 68 transitions. [2018-10-27 06:06:40,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-10-27 06:06:40,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-10-27 06:06:40,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 68 transitions. [2018-10-27 06:06:40,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:40,716 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-10-27 06:06:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 68 transitions. [2018-10-27 06:06:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-10-27 06:06:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:06:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-10-27 06:06:40,720 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-10-27 06:06:40,720 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-10-27 06:06:40,721 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:40,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2018-10-27 06:06:40,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-10-27 06:06:40,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:40,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:40,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:40,723 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:40,723 INFO L793 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 320#L559-2 assume true; 309#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 354#L550-2 main_#t~short6 := main_#t~mem4 != 0; 353#L550-3 assume main_#t~short6; 312#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 313#L550-5 main_#t~short6 := main_#t~mem5 > 0; 315#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 317#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 344#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 330#L559 [2018-10-27 06:06:40,723 INFO L795 eck$LassoCheckResult]: Loop: 330#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 332#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 347#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 333#L560-2 havoc main_#t~mem13; 322#L559-2 assume true; 329#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 302#L550-2 main_#t~short6 := main_#t~mem4 != 0; 303#L550-3 assume main_#t~short6; 306#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 352#L550-5 main_#t~short6 := main_#t~mem5 > 0; 351#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 350#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 349#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 330#L559 [2018-10-27 06:06:40,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1707562592, now seen corresponding path program 1 times [2018-10-27 06:06:40,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:40,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:40,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:40,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:40,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:40,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash -24654176, now seen corresponding path program 1 times [2018-10-27 06:06:40,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:40,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:40,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:40,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1915354977, now seen corresponding path program 1 times [2018-10-27 06:06:40,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:40,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:40,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:40,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:40,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:41,016 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-27 06:06:41,185 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-10-27 06:06:41,238 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:41,239 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:41,239 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:41,239 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:41,239 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:41,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:41,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:41,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:41,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:06:41,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:41,239 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:41,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-10-27 06:06:41,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,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-10-27 06:06:41,485 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-10-27 06:06:41,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:41,980 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:41,980 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:41,980 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-10-27 06:06:41,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:41,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:41,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:41,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:41,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:41,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:41,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:41,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:41,983 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-10-27 06:06:41,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:41,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:41,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:41,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:41,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:41,988 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:41,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:41,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:41,990 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-10-27 06:06:41,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:41,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:41,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:41,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:41,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:41,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:41,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:41,993 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-10-27 06:06:41,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:41,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:41,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:41,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:41,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:41,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:41,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:41,997 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-10-27 06:06:41,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:41,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:41,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:41,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:41,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:41,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:42,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:42,002 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-10-27 06:06:42,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:42,003 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:42,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:42,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:42,004 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:42,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:42,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:42,011 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-10-27 06:06:42,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:42,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:42,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:42,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:42,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:42,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:42,019 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:42,022 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:42,022 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:42,023 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:42,024 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:42,024 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:42,024 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-10-27 06:06:42,320 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:42,337 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:42,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:42,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:42,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:42,656 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:42,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:06:42,674 INFO L477 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 31 treesize of output 24 [2018-10-27 06:06:42,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:42,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2018-10-27 06:06:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:42,808 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-10-27 06:06:42,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 59 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-10-27 06:06:42,971 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 59 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 111 states and 125 transitions. Complement of second has 11 states. [2018-10-27 06:06:42,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:06:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-10-27 06:06:42,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 11 letters. Loop has 13 letters. [2018-10-27 06:06:42,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:42,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 24 letters. Loop has 13 letters. [2018-10-27 06:06:42,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:42,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 11 letters. Loop has 26 letters. [2018-10-27 06:06:42,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:42,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 125 transitions. [2018-10-27 06:06:42,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2018-10-27 06:06:42,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 104 states and 117 transitions. [2018-10-27 06:06:42,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-10-27 06:06:42,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-10-27 06:06:42,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 117 transitions. [2018-10-27 06:06:42,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:42,981 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 117 transitions. [2018-10-27 06:06:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 117 transitions. [2018-10-27 06:06:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-10-27 06:06:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 06:06:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-10-27 06:06:42,987 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-10-27 06:06:42,987 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-10-27 06:06:42,987 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:42,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 109 transitions. [2018-10-27 06:06:42,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2018-10-27 06:06:42,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:42,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:42,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:42,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:42,992 INFO L793 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 633#L559-2 assume true; 710#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 709#L550-2 main_#t~short6 := main_#t~mem4 != 0; 618#L550-3 assume main_#t~short6; 619#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 625#L550-5 main_#t~short6 := main_#t~mem5 > 0; 627#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 706#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 705#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 637#L552 assume main_#t~nondet8 != 0;havoc main_#t~nondet8; 638#L553 [2018-10-27 06:06:42,992 INFO L795 eck$LassoCheckResult]: Loop: 638#L553 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 660#L553-1 SUMMARY for call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 662#L553-2 havoc main_#t~mem9; 659#L554 SUMMARY for call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4); srcloc: L554 634#L554-1 havoc main_#t~nondet10; 621#L559-2 assume true; 622#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 614#L550-2 main_#t~short6 := main_#t~mem4 != 0; 615#L550-3 assume main_#t~short6; 708#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 707#L550-5 main_#t~short6 := main_#t~mem5 > 0; 629#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 630#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 664#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 675#L552 assume main_#t~nondet8 != 0;havoc main_#t~nondet8; 638#L553 [2018-10-27 06:06:42,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:42,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1394833267, now seen corresponding path program 1 times [2018-10-27 06:06:42,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:42,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:42,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:42,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash -329599159, now seen corresponding path program 1 times [2018-10-27 06:06:43,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:43,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:43,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1168278845, now seen corresponding path program 1 times [2018-10-27 06:06:43,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:43,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:43,380 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2018-10-27 06:06:43,432 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:43,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:43,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:43,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:43,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:43,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:43,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:43,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:43,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:06:43,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:43,433 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:43,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,581 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-10-27 06:06:43,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:43,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:44,008 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:44,008 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:44,009 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-10-27 06:06:44,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:44,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:44,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:44,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:44,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:44,014 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-10-27 06:06:44,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:44,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:44,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:44,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:44,024 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-10-27 06:06:44,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:44,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:44,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:44,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:44,032 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-10-27 06:06:44,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:44,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:44,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:44,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:44,039 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-10-27 06:06:44,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:44,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:44,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:44,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:44,043 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-10-27 06:06:44,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,043 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:44,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,049 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:44,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:44,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:44,054 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-10-27 06:06:44,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:44,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:44,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:44,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:44,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:44,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:44,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:44,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:44,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:44,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:44,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:44,080 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:44,084 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:44,084 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:44,085 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:44,085 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:44,086 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:44,086 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-10-27 06:06:44,376 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:44,404 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:44,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:44,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:44,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:06:44,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:06:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:44,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:44,930 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:44,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:44,933 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:44,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:06:44,967 INFO L477 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 21 treesize of output 22 [2018-10-27 06:06:44,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:06:44,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:44,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:06:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:45,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-10-27 06:06:45,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 109 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-10-27 06:06:45,141 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 109 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 292 states and 329 transitions. Complement of second has 12 states. [2018-10-27 06:06:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-10-27 06:06:45,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 72 transitions. Stem has 12 letters. Loop has 15 letters. [2018-10-27 06:06:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 72 transitions. Stem has 27 letters. Loop has 15 letters. [2018-10-27 06:06:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 72 transitions. Stem has 12 letters. Loop has 30 letters. [2018-10-27 06:06:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:45,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 329 transitions. [2018-10-27 06:06:45,147 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 75 [2018-10-27 06:06:45,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 268 states and 303 transitions. [2018-10-27 06:06:45,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2018-10-27 06:06:45,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2018-10-27 06:06:45,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 303 transitions. [2018-10-27 06:06:45,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:45,149 INFO L705 BuchiCegarLoop]: Abstraction has 268 states and 303 transitions. [2018-10-27 06:06:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 303 transitions. [2018-10-27 06:06:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 239. [2018-10-27 06:06:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-27 06:06:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2018-10-27 06:06:45,161 INFO L728 BuchiCegarLoop]: Abstraction has 239 states and 270 transitions. [2018-10-27 06:06:45,161 INFO L608 BuchiCegarLoop]: Abstraction has 239 states and 270 transitions. [2018-10-27 06:06:45,161 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:06:45,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 239 states and 270 transitions. [2018-10-27 06:06:45,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 75 [2018-10-27 06:06:45,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:45,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:45,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:45,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:45,167 INFO L793 eck$LassoCheckResult]: Stem: 1231#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1191#L559-2 assume true; 1288#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 1321#L550-2 main_#t~short6 := main_#t~mem4 != 0; 1320#L550-3 assume main_#t~short6; 1316#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 1276#L550-5 main_#t~short6 := main_#t~mem5 > 0; 1277#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 1310#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 1308#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1309#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 1317#L562 [2018-10-27 06:06:45,167 INFO L795 eck$LassoCheckResult]: Loop: 1317#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 1329#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 1327#L562-2 havoc main_#t~mem14; 1195#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 1196#L563-1 havoc main_#t~nondet15; 1303#L559-2 assume true; 1298#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 1299#L550-2 main_#t~short6 := main_#t~mem4 != 0; 1295#L550-3 assume main_#t~short6; 1293#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 1294#L550-5 main_#t~short6 := main_#t~mem5 > 0; 1315#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 1326#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 1323#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1324#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 1317#L562 [2018-10-27 06:06:45,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1394832750, now seen corresponding path program 1 times [2018-10-27 06:06:45,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:45,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:45,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1000390115, now seen corresponding path program 1 times [2018-10-27 06:06:45,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:45,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:45,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:45,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash 545103666, now seen corresponding path program 1 times [2018-10-27 06:06:45,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:45,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:45,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:45,457 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-10-27 06:06:45,500 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:45,500 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:45,500 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:45,500 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:45,500 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:45,500 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:45,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:45,500 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:45,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:06:45,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:45,501 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:45,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,775 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-10-27 06:06:45,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:45,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:46,133 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:46,133 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:46,133 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-10-27 06:06:46,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,135 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-10-27 06:06:46,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,137 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-10-27 06:06:46,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,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-10-27 06:06:46,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,155 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-10-27 06:06:46,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:46,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,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-10-27 06:06:46,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,174 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-10-27 06:06:46,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,175 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-10-27 06:06:46,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,177 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-10-27 06:06:46,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,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-10-27 06:06:46,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:46,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:46,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:46,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,180 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-10-27 06:06:46,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,182 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-10-27 06:06:46,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,195 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-10-27 06:06:46,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,196 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:46,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,197 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:46,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,206 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-10-27 06:06:46,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,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-10-27 06:06:46,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:46,214 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-10-27 06:06:46,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:46,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:46,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:46,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:46,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:46,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:46,232 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:46,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:46,236 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:46,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:46,236 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:46,237 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:46,237 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-10-27 06:06:46,512 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:46,528 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:46,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:46,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:46,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:46,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:46,725 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:46,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:46,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:46,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:46,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:06:46,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 06:06:46,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 06:06:46,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:06:46,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 06:06:46,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:46,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:46,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:46,814 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-10-27 06:06:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:47,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-10-27 06:06:47,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 239 states and 270 transitions. cyclomatic complexity: 40 Second operand 10 states. [2018-10-27 06:06:47,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 239 states and 270 transitions. cyclomatic complexity: 40. Second operand 10 states. Result 438 states and 491 transitions. Complement of second has 19 states. [2018-10-27 06:06:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:06:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-10-27 06:06:47,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 52 transitions. Stem has 12 letters. Loop has 15 letters. [2018-10-27 06:06:47,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:47,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 52 transitions. Stem has 27 letters. Loop has 15 letters. [2018-10-27 06:06:47,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:47,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 52 transitions. Stem has 12 letters. Loop has 30 letters. [2018-10-27 06:06:47,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:47,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 491 transitions. [2018-10-27 06:06:47,419 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 127 [2018-10-27 06:06:47,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 417 states and 470 transitions. [2018-10-27 06:06:47,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2018-10-27 06:06:47,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2018-10-27 06:06:47,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 470 transitions. [2018-10-27 06:06:47,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:47,427 INFO L705 BuchiCegarLoop]: Abstraction has 417 states and 470 transitions. [2018-10-27 06:06:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 470 transitions. [2018-10-27 06:06:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 394. [2018-10-27 06:06:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-27 06:06:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 444 transitions. [2018-10-27 06:06:47,443 INFO L728 BuchiCegarLoop]: Abstraction has 394 states and 444 transitions. [2018-10-27 06:06:47,443 INFO L608 BuchiCegarLoop]: Abstraction has 394 states and 444 transitions. [2018-10-27 06:06:47,443 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:06:47,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 444 transitions. [2018-10-27 06:06:47,448 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 127 [2018-10-27 06:06:47,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:47,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:47,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:47,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:47,449 INFO L793 eck$LassoCheckResult]: Stem: 2083#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2037#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2038#L559-2 assume true; 2163#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 2164#L550-2 main_#t~short6 := main_#t~mem4 != 0; 2159#L550-3 assume main_#t~short6; 2160#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 2225#L550-5 main_#t~short6 := main_#t~mem5 > 0; 2155#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 2153#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 2154#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2217#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 2295#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 2293#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 2291#L560-2 havoc main_#t~mem13; 2289#L559-2 assume true; 2287#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 2285#L550-2 main_#t~short6 := main_#t~mem4 != 0; 2283#L550-3 assume main_#t~short6; 2281#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 2279#L550-5 main_#t~short6 := main_#t~mem5 > 0; 2277#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 2274#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 2271#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 2235#L552 [2018-10-27 06:06:47,449 INFO L795 eck$LassoCheckResult]: Loop: 2235#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 2266#L556 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 2261#L556-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 2256#L556-2 havoc main_#t~mem11; 2253#L559-2 assume true; 2251#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 2249#L550-2 main_#t~short6 := main_#t~mem4 != 0; 2247#L550-3 assume main_#t~short6; 2245#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 2243#L550-5 main_#t~short6 := main_#t~mem5 > 0; 2241#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 2239#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 2234#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 2235#L552 [2018-10-27 06:06:47,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1915354961, now seen corresponding path program 1 times [2018-10-27 06:06:47,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:47,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:47,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:47,714 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:47,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:47,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-10-27 06:06:47,947 INFO L477 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 27 treesize of output 20 [2018-10-27 06:06:47,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:47,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:47,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:47,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:7 [2018-10-27 06:06:47,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 06:06:47,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:06:47,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:47,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:48,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:48,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 06:06:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:48,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:48,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-10-27 06:06:48,034 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:48,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2079424304, now seen corresponding path program 2 times [2018-10-27 06:06:48,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:48,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,315 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-27 06:06:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:06:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:06:48,366 INFO L87 Difference]: Start difference. First operand 394 states and 444 transitions. cyclomatic complexity: 65 Second operand 13 states. [2018-10-27 06:06:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:48,738 INFO L93 Difference]: Finished difference Result 317 states and 352 transitions. [2018-10-27 06:06:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 06:06:48,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 352 transitions. [2018-10-27 06:06:48,742 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 93 [2018-10-27 06:06:48,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 293 states and 326 transitions. [2018-10-27 06:06:48,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-10-27 06:06:48,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-10-27 06:06:48,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 326 transitions. [2018-10-27 06:06:48,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:48,746 INFO L705 BuchiCegarLoop]: Abstraction has 293 states and 326 transitions. [2018-10-27 06:06:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 326 transitions. [2018-10-27 06:06:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2018-10-27 06:06:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-27 06:06:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 317 transitions. [2018-10-27 06:06:48,756 INFO L728 BuchiCegarLoop]: Abstraction has 284 states and 317 transitions. [2018-10-27 06:06:48,756 INFO L608 BuchiCegarLoop]: Abstraction has 284 states and 317 transitions. [2018-10-27 06:06:48,756 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:06:48,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 317 transitions. [2018-10-27 06:06:48,758 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 93 [2018-10-27 06:06:48,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:48,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:48,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:48,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:48,759 INFO L793 eck$LassoCheckResult]: Stem: 2891#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2851#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2852#L559-2 assume true; 2938#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 2937#L550-2 main_#t~short6 := main_#t~mem4 != 0; 2936#L550-3 assume main_#t~short6; 2935#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 2934#L550-5 main_#t~short6 := main_#t~mem5 > 0; 2933#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 2932#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 2931#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2926#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 2871#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 2989#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 2987#L562-2 havoc main_#t~mem14; 2985#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 2983#L563-1 havoc main_#t~nondet15; 2972#L559-2 assume true; 2969#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 2966#L550-2 main_#t~short6 := main_#t~mem4 != 0; 2963#L550-3 assume main_#t~short6; 2960#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 2957#L550-5 main_#t~short6 := main_#t~mem5 > 0; 2954#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 2951#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 2919#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 2920#L552 [2018-10-27 06:06:48,759 INFO L795 eck$LassoCheckResult]: Loop: 2920#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 2978#L556 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 2976#L556-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 2973#L556-2 havoc main_#t~mem11; 2971#L559-2 assume true; 2968#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 2965#L550-2 main_#t~short6 := main_#t~mem4 != 0; 2962#L550-3 assume main_#t~short6; 2959#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 2956#L550-5 main_#t~short6 := main_#t~mem5 > 0; 2953#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 2945#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 2946#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 2920#L552 [2018-10-27 06:06:48,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash 433225968, now seen corresponding path program 1 times [2018-10-27 06:06:48,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:48,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2079424304, now seen corresponding path program 3 times [2018-10-27 06:06:48,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:48,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash 844840001, now seen corresponding path program 1 times [2018-10-27 06:06:48,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:48,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:48,965 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-27 06:06:49,294 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 106 [2018-10-27 06:06:49,355 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:49,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:49,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:49,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:49,355 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:49,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:49,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:49,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:49,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration7_Lasso [2018-10-27 06:06:49,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:49,355 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:49,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:49,859 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:49,860 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:49,860 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-10-27 06:06:49,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,862 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-10-27 06:06:49,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:49,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:49,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:49,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,868 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-10-27 06:06:49,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:49,879 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-10-27 06:06:49,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:49,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:49,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:49,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:49,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:49,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:49,885 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:49,893 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:49,893 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:49,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:49,894 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:49,894 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:49,894 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 Supporting invariants [] [2018-10-27 06:06:49,966 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:49,967 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:49,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:50,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:50,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:50,033 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:50,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:50,056 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:50,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:50,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:50,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:50,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:06:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:50,114 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:50,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 284 states and 317 transitions. cyclomatic complexity: 44 Second operand 8 states. [2018-10-27 06:06:50,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 284 states and 317 transitions. cyclomatic complexity: 44. Second operand 8 states. Result 455 states and 508 transitions. Complement of second has 13 states. [2018-10-27 06:06:50,200 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-10-27 06:06:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:06:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-10-27 06:06:50,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 26 letters. Loop has 13 letters. [2018-10-27 06:06:50,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:50,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 39 letters. Loop has 13 letters. [2018-10-27 06:06:50,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:50,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 26 letters. Loop has 26 letters. [2018-10-27 06:06:50,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:50,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 508 transitions. [2018-10-27 06:06:50,212 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 120 [2018-10-27 06:06:50,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 406 states and 455 transitions. [2018-10-27 06:06:50,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2018-10-27 06:06:50,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2018-10-27 06:06:50,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 406 states and 455 transitions. [2018-10-27 06:06:50,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:50,221 INFO L705 BuchiCegarLoop]: Abstraction has 406 states and 455 transitions. [2018-10-27 06:06:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states and 455 transitions. [2018-10-27 06:06:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2018-10-27 06:06:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 06:06:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 428 transitions. [2018-10-27 06:06:50,232 INFO L728 BuchiCegarLoop]: Abstraction has 382 states and 428 transitions. [2018-10-27 06:06:50,232 INFO L608 BuchiCegarLoop]: Abstraction has 382 states and 428 transitions. [2018-10-27 06:06:50,233 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:06:50,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 428 transitions. [2018-10-27 06:06:50,234 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 120 [2018-10-27 06:06:50,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:50,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:50,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:50,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:50,240 INFO L793 eck$LassoCheckResult]: Stem: 3841#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3795#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3796#L559-2 assume true; 3961#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 3958#L550-2 main_#t~short6 := main_#t~mem4 != 0; 3956#L550-3 assume main_#t~short6; 3953#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 3951#L550-5 main_#t~short6 := main_#t~mem5 > 0; 3948#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 3947#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 3946#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3886#L552 assume main_#t~nondet8 != 0;havoc main_#t~nondet8; 3887#L553 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 3843#L553-1 SUMMARY for call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 3844#L553-2 havoc main_#t~mem9; 3835#L554 SUMMARY for call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4); srcloc: L554 3836#L554-1 havoc main_#t~nondet10; 4041#L559-2 assume true; 4039#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 4036#L550-2 main_#t~short6 := main_#t~mem4 != 0; 4033#L550-3 assume main_#t~short6; 4030#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 4027#L550-5 main_#t~short6 := main_#t~mem5 > 0; 4024#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 4020#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 4017#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 4013#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 4008#L556 [2018-10-27 06:06:50,241 INFO L795 eck$LassoCheckResult]: Loop: 4008#L556 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 4005#L556-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 4000#L556-2 havoc main_#t~mem11; 4001#L559-2 assume true; 4038#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 4035#L550-2 main_#t~short6 := main_#t~mem4 != 0; 4032#L550-3 assume main_#t~short6; 4029#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 4026#L550-5 main_#t~short6 := main_#t~mem5 > 0; 4023#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 4019#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 4016#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 4011#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 4008#L556 [2018-10-27 06:06:50,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1168278852, now seen corresponding path program 1 times [2018-10-27 06:06:50,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:50,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:50,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:50,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:50,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1030513066, now seen corresponding path program 4 times [2018-10-27 06:06:50,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:50,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:50,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:50,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1963131405, now seen corresponding path program 1 times [2018-10-27 06:06:50,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:50,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:50,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:50,457 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-27 06:06:50,740 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2018-10-27 06:06:50,804 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:50,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:50,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:50,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:50,805 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:50,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:50,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:50,805 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:50,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration8_Lasso [2018-10-27 06:06:50,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:50,805 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:50,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:50,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,014 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2018-10-27 06:06:51,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:51,391 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:51,391 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:51,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:51,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:51,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:51,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:51,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,394 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-10-27 06:06:51,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:51,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:51,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:51,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,403 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-10-27 06:06:51,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:51,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:51,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,417 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-10-27 06:06:51,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:51,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:51,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,420 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-10-27 06:06:51,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,427 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-10-27 06:06:51,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,429 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-10-27 06:06:51,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,431 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-10-27 06:06:51,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,436 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-10-27 06:06:51,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,437 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-10-27 06:06:51,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:51,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:51,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:51,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:51,448 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-10-27 06:06:51,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:51,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:51,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:51,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:51,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:51,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:51,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:51,458 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:51,458 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:51,459 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:51,479 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:51,480 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:51,480 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-10-27 06:06:51,608 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:51,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:51,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:51,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:51,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:51,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:51,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:51,674 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:51,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:51,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:51,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:51,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:06:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:51,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:51,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 382 states and 428 transitions. cyclomatic complexity: 61 Second operand 7 states. [2018-10-27 06:06:51,912 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 382 states and 428 transitions. cyclomatic complexity: 61. Second operand 7 states. Result 755 states and 839 transitions. Complement of second has 13 states. [2018-10-27 06:06:51,920 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-10-27 06:06:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-10-27 06:06:51,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 27 letters. Loop has 13 letters. [2018-10-27 06:06:51,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:51,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 40 letters. Loop has 13 letters. [2018-10-27 06:06:51,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:51,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 50 transitions. Stem has 27 letters. Loop has 26 letters. [2018-10-27 06:06:51,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:51,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 839 transitions. [2018-10-27 06:06:51,930 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 153 [2018-10-27 06:06:51,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 631 states and 705 transitions. [2018-10-27 06:06:51,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2018-10-27 06:06:51,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 313 [2018-10-27 06:06:51,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 705 transitions. [2018-10-27 06:06:51,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:51,933 INFO L705 BuchiCegarLoop]: Abstraction has 631 states and 705 transitions. [2018-10-27 06:06:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 705 transitions. [2018-10-27 06:06:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 586. [2018-10-27 06:06:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-10-27 06:06:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 654 transitions. [2018-10-27 06:06:51,949 INFO L728 BuchiCegarLoop]: Abstraction has 586 states and 654 transitions. [2018-10-27 06:06:51,949 INFO L608 BuchiCegarLoop]: Abstraction has 586 states and 654 transitions. [2018-10-27 06:06:51,949 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:06:51,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 586 states and 654 transitions. [2018-10-27 06:06:51,954 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 153 [2018-10-27 06:06:51,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:51,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:51,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:51,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:51,957 INFO L793 eck$LassoCheckResult]: Stem: 5172#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 5131#L559-2 assume true; 5310#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 5383#L550-2 main_#t~short6 := main_#t~mem4 != 0; 5381#L550-3 assume main_#t~short6; 5379#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 5377#L550-5 main_#t~short6 := main_#t~mem5 > 0; 5375#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 5373#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 5367#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 5364#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 5336#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 5365#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 5363#L562-2 havoc main_#t~mem14; 5362#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 5360#L563-1 havoc main_#t~nondet15; 5358#L559-2 assume true; 5356#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 5354#L550-2 main_#t~short6 := main_#t~mem4 != 0; 5352#L550-3 assume main_#t~short6; 5350#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 5348#L550-5 main_#t~short6 := main_#t~mem5 > 0; 5346#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 5344#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 5342#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 5338#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 5334#L560 [2018-10-27 06:06:51,957 INFO L795 eck$LassoCheckResult]: Loop: 5334#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 5386#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 5385#L560-2 havoc main_#t~mem13; 5384#L559-2 assume true; 5382#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 5380#L550-2 main_#t~short6 := main_#t~mem4 != 0; 5378#L550-3 assume main_#t~short6; 5376#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 5374#L550-5 main_#t~short6 := main_#t~mem5 > 0; 5372#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 5371#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 5366#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 5333#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 5334#L560 [2018-10-27 06:06:51,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,957 INFO L82 PathProgramCache]: Analyzing trace with hash 545103661, now seen corresponding path program 1 times [2018-10-27 06:06:51,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:51,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1502088200, now seen corresponding path program 2 times [2018-10-27 06:06:51,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:51,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:51,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:51,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:52,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1955374004, now seen corresponding path program 1 times [2018-10-27 06:06:52,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:52,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:52,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:52,167 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-27 06:06:52,400 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2018-10-27 06:06:52,458 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:52,458 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:52,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:52,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:52,458 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:52,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:52,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:52,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:52,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration9_Lasso [2018-10-27 06:06:52,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:52,459 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:52,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,671 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-10-27 06:06:52,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:52,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:53,110 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:53,110 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:53,110 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-10-27 06:06:53,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,116 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-10-27 06:06:53,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,118 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-10-27 06:06:53,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:53,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:53,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:53,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,119 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-10-27 06:06:53,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,121 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-10-27 06:06:53,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,133 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-10-27 06:06:53,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:53,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,154 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-10-27 06:06:53,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,155 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:53,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,155 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:53,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,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-10-27 06:06:53,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,161 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-10-27 06:06:53,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,176 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-10-27 06:06:53,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,176 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:53,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,177 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:53,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:53,179 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-10-27 06:06:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:53,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:53,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:53,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:53,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:53,183 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:53,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:53,185 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:53,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:53,186 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:53,186 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:53,186 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 Supporting invariants [] [2018-10-27 06:06:53,255 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:53,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:53,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:53,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:53,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:53,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:53,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:06:53,325 INFO L477 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 31 treesize of output 24 [2018-10-27 06:06:53,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2018-10-27 06:06:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:53,404 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-10-27 06:06:53,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 586 states and 654 transitions. cyclomatic complexity: 93 Second operand 6 states. [2018-10-27 06:06:53,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 586 states and 654 transitions. cyclomatic complexity: 93. Second operand 6 states. Result 1115 states and 1235 transitions. Complement of second has 11 states. [2018-10-27 06:06:53,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:06:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-10-27 06:06:53,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 27 letters. Loop has 13 letters. [2018-10-27 06:06:53,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:53,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 40 letters. Loop has 13 letters. [2018-10-27 06:06:53,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:53,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 27 letters. Loop has 26 letters. [2018-10-27 06:06:53,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:53,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1115 states and 1235 transitions. [2018-10-27 06:06:53,465 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 230 [2018-10-27 06:06:53,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1115 states to 995 states and 1107 transitions. [2018-10-27 06:06:53,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 478 [2018-10-27 06:06:53,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2018-10-27 06:06:53,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 995 states and 1107 transitions. [2018-10-27 06:06:53,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:53,472 INFO L705 BuchiCegarLoop]: Abstraction has 995 states and 1107 transitions. [2018-10-27 06:06:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states and 1107 transitions. [2018-10-27 06:06:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 975. [2018-10-27 06:06:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2018-10-27 06:06:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1087 transitions. [2018-10-27 06:06:53,489 INFO L728 BuchiCegarLoop]: Abstraction has 975 states and 1087 transitions. [2018-10-27 06:06:53,489 INFO L608 BuchiCegarLoop]: Abstraction has 975 states and 1087 transitions. [2018-10-27 06:06:53,489 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:06:53,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 975 states and 1087 transitions. [2018-10-27 06:06:53,495 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 230 [2018-10-27 06:06:53,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:53,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:53,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:53,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:53,498 INFO L793 eck$LassoCheckResult]: Stem: 7071#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7027#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 7028#L559-2 assume true; 7208#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 7206#L550-2 main_#t~short6 := main_#t~mem4 != 0; 7204#L550-3 assume main_#t~short6; 7202#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 7200#L550-5 main_#t~short6 := main_#t~mem5 > 0; 7198#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 7196#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 7193#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 7189#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 7190#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 7182#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 7180#L562-2 havoc main_#t~mem14; 7178#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 7176#L563-1 havoc main_#t~nondet15; 7174#L559-2 assume true; 7172#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 7170#L550-2 main_#t~short6 := main_#t~mem4 != 0; 7168#L550-3 assume main_#t~short6; 7166#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 7164#L550-5 main_#t~short6 := main_#t~mem5 > 0; 7162#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 7160#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 7156#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 7151#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 7147#L556 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 7144#L556-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 7141#L556-2 havoc main_#t~mem11; 7139#L559-2 assume true; 7137#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 7135#L550-2 main_#t~short6 := main_#t~mem4 != 0; 7133#L550-3 assume main_#t~short6; 7131#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 7129#L550-5 main_#t~short6 := main_#t~mem5 > 0; 7127#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 7123#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 7118#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 7120#L559 [2018-10-27 06:06:53,498 INFO L795 eck$LassoCheckResult]: Loop: 7120#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 7158#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 7155#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 7149#L562-2 havoc main_#t~mem14; 7146#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 7143#L563-1 havoc main_#t~nondet15; 7140#L559-2 assume true; 7138#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 7136#L550-2 main_#t~short6 := main_#t~mem4 != 0; 7134#L550-3 assume main_#t~short6; 7132#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 7130#L550-5 main_#t~short6 := main_#t~mem5 > 0; 7128#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 7125#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 7126#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 7120#L559 [2018-10-27 06:06:53,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash 844840017, now seen corresponding path program 2 times [2018-10-27 06:06:53,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:53,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 06:06:53,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:06:53,578 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:06:53,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:06:53,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:06:53,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:06:53,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:53,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:06:53,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:06:53,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:06:53,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:06:53,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-27 06:06:53,661 INFO L477 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 21 treesize of output 22 [2018-10-27 06:06:53,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:06:53,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-10-27 06:06:53,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 06:06:53,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:06:53,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:53,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 06:06:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 06:06:53,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:06:53,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-27 06:06:53,763 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:53,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:53,764 INFO L82 PathProgramCache]: Analyzing trace with hash 100236415, now seen corresponding path program 2 times [2018-10-27 06:06:53,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:53,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:53,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:53,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:53,881 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-10-27 06:06:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:06:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:06:53,902 INFO L87 Difference]: Start difference. First operand 975 states and 1087 transitions. cyclomatic complexity: 155 Second operand 8 states. [2018-10-27 06:06:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:53,973 INFO L93 Difference]: Finished difference Result 863 states and 949 transitions. [2018-10-27 06:06:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:06:53,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 863 states and 949 transitions. [2018-10-27 06:06:53,978 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 198 [2018-10-27 06:06:53,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 863 states to 863 states and 949 transitions. [2018-10-27 06:06:53,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2018-10-27 06:06:53,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 406 [2018-10-27 06:06:53,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 949 transitions. [2018-10-27 06:06:53,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:53,982 INFO L705 BuchiCegarLoop]: Abstraction has 863 states and 949 transitions. [2018-10-27 06:06:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 949 transitions. [2018-10-27 06:06:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 837. [2018-10-27 06:06:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-27 06:06:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 923 transitions. [2018-10-27 06:06:53,998 INFO L728 BuchiCegarLoop]: Abstraction has 837 states and 923 transitions. [2018-10-27 06:06:53,998 INFO L608 BuchiCegarLoop]: Abstraction has 837 states and 923 transitions. [2018-10-27 06:06:53,998 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:06:53,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 837 states and 923 transitions. [2018-10-27 06:06:54,005 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 198 [2018-10-27 06:06:54,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:54,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:54,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,006 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,006 INFO L793 eck$LassoCheckResult]: Stem: 9029#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8993#L559-2 assume true; 9187#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 9184#L550-2 main_#t~short6 := main_#t~mem4 != 0; 9181#L550-3 assume main_#t~short6; 9178#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 9175#L550-5 main_#t~short6 := main_#t~mem5 > 0; 9172#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 9169#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 9166#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 9165#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 9164#L556 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 9163#L556-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 9161#L556-2 havoc main_#t~mem11; 9160#L559-2 assume true; 9159#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 9158#L550-2 main_#t~short6 := main_#t~mem4 != 0; 9157#L550-3 assume main_#t~short6; 9156#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 9155#L550-5 main_#t~short6 := main_#t~mem5 > 0; 9154#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 9152#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 9153#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 9341#L552 assume main_#t~nondet8 != 0;havoc main_#t~nondet8; 9335#L553 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 9336#L553-1 SUMMARY for call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 9399#L553-2 havoc main_#t~mem9; 9396#L554 SUMMARY for call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4); srcloc: L554 9392#L554-1 havoc main_#t~nondet10; 9388#L559-2 assume true; 9384#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 9380#L550-2 main_#t~short6 := main_#t~mem4 != 0; 9376#L550-3 assume main_#t~short6; 9372#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 9368#L550-5 main_#t~short6 := main_#t~mem5 > 0; 9364#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 9359#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 9355#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 9349#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 9347#L556 [2018-10-27 06:06:54,006 INFO L795 eck$LassoCheckResult]: Loop: 9347#L556 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 9395#L556-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 9391#L556-2 havoc main_#t~mem11; 9387#L559-2 assume true; 9383#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 9379#L550-2 main_#t~short6 := main_#t~mem4 != 0; 9375#L550-3 assume main_#t~short6; 9371#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 9367#L550-5 main_#t~short6 := main_#t~mem5 > 0; 9363#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 9358#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 9354#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 9346#L552 assume !(main_#t~nondet8 != 0);havoc main_#t~nondet8; 9347#L556 [2018-10-27 06:06:54,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1206497621, now seen corresponding path program 2 times [2018-10-27 06:06:54,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1030513066, now seen corresponding path program 5 times [2018-10-27 06:06:54,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -763906686, now seen corresponding path program 3 times [2018-10-27 06:06:54,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,620 WARN L179 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-27 06:06:54,964 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 121 [2018-10-27 06:06:55,051 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:55,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:55,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:55,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:55,051 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:55,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:55,051 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:55,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:55,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration11_Lasso [2018-10-27 06:06:55,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:55,052 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:55,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,324 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-10-27 06:06:55,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:55,617 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:55,617 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:55,617 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-10-27 06:06:55,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,620 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-10-27 06:06:55,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:55,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:55,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:55,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:55,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:55,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:55,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,626 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-10-27 06:06:55,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:55,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:55,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,628 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-10-27 06:06:55,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:55,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,631 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-10-27 06:06:55,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,632 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-10-27 06:06:55,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,634 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-10-27 06:06:55,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:55,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:55,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:55,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,638 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-10-27 06:06:55,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:55,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,641 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-10-27 06:06:55,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,642 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-10-27 06:06:55,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:55,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:55,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:55,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:55,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,645 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-10-27 06:06:55,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:55,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:55,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,650 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-10-27 06:06:55,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:55,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:55,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:55,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:55,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:55,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:55,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:55,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:55,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:55,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:55,657 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:55,661 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:55,661 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:06:55,661 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:55,662 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:55,662 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:55,662 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_8 Supporting invariants [] [2018-10-27 06:06:55,979 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:55,980 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:55,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:56,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:56,032 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:56,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:06:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:56,075 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 837 states and 923 transitions. cyclomatic complexity: 123 Second operand 7 states. [2018-10-27 06:06:56,387 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 837 states and 923 transitions. cyclomatic complexity: 123. Second operand 7 states. Result 1056 states and 1156 transitions. Complement of second has 13 states. [2018-10-27 06:06:56,388 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-10-27 06:06:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-10-27 06:06:56,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 40 letters. Loop has 13 letters. [2018-10-27 06:06:56,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:56,389 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:56,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:56,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:56,712 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:56,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:06:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:56,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 837 states and 923 transitions. cyclomatic complexity: 123 Second operand 7 states. [2018-10-27 06:06:56,819 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 837 states and 923 transitions. cyclomatic complexity: 123. Second operand 7 states. Result 1046 states and 1140 transitions. Complement of second has 13 states. [2018-10-27 06:06:56,821 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-10-27 06:06:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-10-27 06:06:56,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 40 letters. Loop has 13 letters. [2018-10-27 06:06:56,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:56,822 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:06:56,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:56,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:56,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:56,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:56,938 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:56,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:56,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:06:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:56,989 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:06:56,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 837 states and 923 transitions. cyclomatic complexity: 123 Second operand 7 states. [2018-10-27 06:06:57,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 837 states and 923 transitions. cyclomatic complexity: 123. Second operand 7 states. Result 1180 states and 1298 transitions. Complement of second has 14 states. [2018-10-27 06:06:57,079 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-10-27 06:06:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:06:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2018-10-27 06:06:57,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 40 letters. Loop has 13 letters. [2018-10-27 06:06:57,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:57,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 53 letters. Loop has 13 letters. [2018-10-27 06:06:57,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:57,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 40 letters. Loop has 26 letters. [2018-10-27 06:06:57,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:57,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1180 states and 1298 transitions. [2018-10-27 06:06:57,087 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 171 [2018-10-27 06:06:57,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1180 states to 912 states and 1000 transitions. [2018-10-27 06:06:57,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2018-10-27 06:06:57,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-10-27 06:06:57,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 912 states and 1000 transitions. [2018-10-27 06:06:57,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:06:57,092 INFO L705 BuchiCegarLoop]: Abstraction has 912 states and 1000 transitions. [2018-10-27 06:06:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states and 1000 transitions. [2018-10-27 06:06:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 533. [2018-10-27 06:06:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-27 06:06:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 589 transitions. [2018-10-27 06:06:57,103 INFO L728 BuchiCegarLoop]: Abstraction has 533 states and 589 transitions. [2018-10-27 06:06:57,104 INFO L608 BuchiCegarLoop]: Abstraction has 533 states and 589 transitions. [2018-10-27 06:06:57,104 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:06:57,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 533 states and 589 transitions. [2018-10-27 06:06:57,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 113 [2018-10-27 06:06:57,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:57,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:57,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:57,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:57,106 INFO L793 eck$LassoCheckResult]: Stem: 13761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 13721#L559-2 assume true; 13839#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 13838#L550-2 main_#t~short6 := main_#t~mem4 != 0; 13837#L550-3 assume main_#t~short6; 13836#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 13835#L550-5 main_#t~short6 := main_#t~mem5 > 0; 13834#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 13833#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 13831#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 13832#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 14068#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 14066#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 14064#L562-2 havoc main_#t~mem14; 14062#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 14060#L563-1 havoc main_#t~nondet15; 14058#L559-2 assume true; 14056#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 14054#L550-2 main_#t~short6 := main_#t~mem4 != 0; 14052#L550-3 assume main_#t~short6; 14050#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 14048#L550-5 main_#t~short6 := main_#t~mem5 > 0; 14046#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 14044#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 14042#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 14036#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 14035#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 14033#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 14031#L560-2 havoc main_#t~mem13; 14029#L559-2 assume true; 14027#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 14025#L550-2 main_#t~short6 := main_#t~mem4 != 0; 14023#L550-3 assume main_#t~short6; 14021#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 14019#L550-5 main_#t~short6 := main_#t~mem5 > 0; 14017#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 14015#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 14013#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 14010#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 14009#L562 [2018-10-27 06:06:57,106 INFO L795 eck$LassoCheckResult]: Loop: 14009#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 14008#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 14007#L562-2 havoc main_#t~mem14; 14006#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 14005#L563-1 havoc main_#t~nondet15; 14004#L559-2 assume true; 14003#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 14002#L550-2 main_#t~short6 := main_#t~mem4 != 0; 14001#L550-3 assume main_#t~short6; 14000#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 13999#L550-5 main_#t~short6 := main_#t~mem5 > 0; 13998#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 13997#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 13993#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 13995#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 14009#L562 [2018-10-27 06:06:57,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1955373999, now seen corresponding path program 2 times [2018-10-27 06:06:57,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1000390115, now seen corresponding path program 3 times [2018-10-27 06:06:57,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:57,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -450938989, now seen corresponding path program 3 times [2018-10-27 06:06:57,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:57,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:57,263 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-10-27 06:06:57,666 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 130 [2018-10-27 06:06:57,781 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-10-27 06:06:57,783 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:57,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:57,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:57,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:57,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:57,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:57,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:57,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:57,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration12_Lasso [2018-10-27 06:06:57,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:57,784 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:57,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:57,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:57,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:57,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:57,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:57,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,310 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2018-10-27 06:06:58,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:58,767 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:58,767 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:58,767 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-10-27 06:06:58,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:58,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:58,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:58,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:58,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,771 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-10-27 06:06:58,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:58,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:58,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:58,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,788 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-10-27 06:06:58,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:58,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:58,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:58,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:58,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,796 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-10-27 06:06:58,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,809 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-10-27 06:06:58,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,812 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-10-27 06:06:58,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:58,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,822 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:58,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:58,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,825 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-10-27 06:06:58,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,826 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:06:58,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,836 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:58,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:58,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,842 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-10-27 06:06:58,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,845 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-10-27 06:06:58,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:58,857 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-10-27 06:06:58,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:58,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:58,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:58,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:58,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:58,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:58,860 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:58,877 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:58,877 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:06:58,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:58,878 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:58,878 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:58,878 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9 Supporting invariants [] [2018-10-27 06:06:59,180 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:06:59,190 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:59,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:59,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:59,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:59,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:59,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:06:59,684 INFO L477 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 29 treesize of output 22 [2018-10-27 06:06:59,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:59,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:59,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:59,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:06:59,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 06:06:59,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 06:06:59,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:59,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 06:06:59,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:06:59,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:59,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:59,790 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-10-27 06:06:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:59,948 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-10-27 06:06:59,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 533 states and 589 transitions. cyclomatic complexity: 76 Second operand 10 states. [2018-10-27 06:07:00,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 533 states and 589 transitions. cyclomatic complexity: 76. Second operand 10 states. Result 734 states and 802 transitions. Complement of second has 19 states. [2018-10-27 06:07:00,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:07:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-10-27 06:07:00,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 52 transitions. Stem has 40 letters. Loop has 15 letters. [2018-10-27 06:07:00,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:00,094 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:00,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:00,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:00,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:00,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:00,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:07:00,147 INFO L477 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 29 treesize of output 22 [2018-10-27 06:07:00,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:00,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:00,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:00,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:07:00,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 06:07:00,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 06:07:00,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:00,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 06:07:00,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:07:00,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:07:00,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:07:00,236 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-10-27 06:07:00,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-10-27 06:07:00,344 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2018-10-27 06:07:00,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 533 states and 589 transitions. cyclomatic complexity: 76 Second operand 10 states. [2018-10-27 06:07:00,520 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 533 states and 589 transitions. cyclomatic complexity: 76. Second operand 10 states. Result 826 states and 903 transitions. Complement of second has 19 states. [2018-10-27 06:07:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:07:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-10-27 06:07:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 40 letters. Loop has 15 letters. [2018-10-27 06:07:00,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 55 letters. Loop has 15 letters. [2018-10-27 06:07:00,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 40 letters. Loop has 30 letters. [2018-10-27 06:07:00,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:00,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 903 transitions. [2018-10-27 06:07:00,526 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2018-10-27 06:07:00,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 684 states and 751 transitions. [2018-10-27 06:07:00,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2018-10-27 06:07:00,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2018-10-27 06:07:00,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 684 states and 751 transitions. [2018-10-27 06:07:00,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:00,530 INFO L705 BuchiCegarLoop]: Abstraction has 684 states and 751 transitions. [2018-10-27 06:07:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states and 751 transitions. [2018-10-27 06:07:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 571. [2018-10-27 06:07:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-10-27 06:07:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 634 transitions. [2018-10-27 06:07:00,540 INFO L728 BuchiCegarLoop]: Abstraction has 571 states and 634 transitions. [2018-10-27 06:07:00,540 INFO L608 BuchiCegarLoop]: Abstraction has 571 states and 634 transitions. [2018-10-27 06:07:00,540 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:07:00,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states and 634 transitions. [2018-10-27 06:07:00,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2018-10-27 06:07:00,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:00,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:00,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:00,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:00,543 INFO L793 eck$LassoCheckResult]: Stem: 16313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 16274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 16275#L559-2 assume true; 16413#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 16411#L550-2 main_#t~short6 := main_#t~mem4 != 0; 16409#L550-3 assume main_#t~short6; 16407#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 16405#L550-5 main_#t~short6 := main_#t~mem5 > 0; 16403#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 16401#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 16398#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 16394#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 16396#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 16561#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 16558#L560-2 havoc main_#t~mem13; 16556#L559-2 assume true; 16557#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 16552#L550-2 main_#t~short6 := main_#t~mem4 != 0; 16553#L550-3 assume main_#t~short6; 16548#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 16549#L550-5 main_#t~short6 := main_#t~mem5 > 0; 16544#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 16545#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 16540#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 16541#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 16564#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 16321#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 16327#L562-2 havoc main_#t~mem14; 16280#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 16281#L563-1 havoc main_#t~nondet15; 16261#L559-2 [2018-10-27 06:07:00,543 INFO L795 eck$LassoCheckResult]: Loop: 16261#L559-2 assume true; 16262#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 16254#L550-2 main_#t~short6 := main_#t~mem4 != 0; 16255#L550-3 assume main_#t~short6; 16258#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 16265#L550-5 main_#t~short6 := main_#t~mem5 > 0; 16268#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 16271#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 16322#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 16330#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 16340#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 16339#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 16298#L560-2 havoc main_#t~mem13; 16261#L559-2 [2018-10-27 06:07:00,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash 669294948, now seen corresponding path program 4 times [2018-10-27 06:07:00,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:00,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:00,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1362123108, now seen corresponding path program 3 times [2018-10-27 06:07:00,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:00,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash -262254367, now seen corresponding path program 5 times [2018-10-27 06:07:00,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:00,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:00,847 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-27 06:07:01,232 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 117 [2018-10-27 06:07:01,308 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:01,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:01,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:01,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:01,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:01,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:01,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:01,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:01,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration13_Lasso [2018-10-27 06:07:01,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:01,309 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:01,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,806 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-10-27 06:07:01,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:01,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:02,171 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:02,171 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:02,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-10-27 06:07:02,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:02,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:02,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:02,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:02,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:02,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:02,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:02,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:02,173 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-10-27 06:07:02,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:02,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:02,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:02,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:02,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:02,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:02,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:02,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:02,174 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-10-27 06:07:02,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:02,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:02,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:02,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:02,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:02,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:02,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:02,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:02,175 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-10-27 06:07:02,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:02,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:02,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:02,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:02,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:02,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:02,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:02,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-10-27 06:07:02,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:02,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:02,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:02,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:02,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:02,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:02,187 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:02,195 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:02,196 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:02,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:02,198 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:02,198 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:02,198 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_10) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_10 Supporting invariants [] [2018-10-27 06:07:02,266 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:07:02,268 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:02,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:02,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:02,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:02,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:02,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-10-27 06:07:02,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-10-27 06:07:02,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-10-27 06:07:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:02,558 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-10-27 06:07:02,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 571 states and 634 transitions. cyclomatic complexity: 84 Second operand 7 states. [2018-10-27 06:07:02,599 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 571 states and 634 transitions. cyclomatic complexity: 84. Second operand 7 states. Result 918 states and 1007 transitions. Complement of second has 11 states. [2018-10-27 06:07:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-10-27 06:07:02,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 30 letters. Loop has 13 letters. [2018-10-27 06:07:02,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 43 letters. Loop has 13 letters. [2018-10-27 06:07:02,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 30 letters. Loop has 26 letters. [2018-10-27 06:07:02,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:02,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 918 states and 1007 transitions. [2018-10-27 06:07:02,617 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2018-10-27 06:07:02,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 918 states to 806 states and 887 transitions. [2018-10-27 06:07:02,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2018-10-27 06:07:02,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2018-10-27 06:07:02,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 806 states and 887 transitions. [2018-10-27 06:07:02,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:02,623 INFO L705 BuchiCegarLoop]: Abstraction has 806 states and 887 transitions. [2018-10-27 06:07:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states and 887 transitions. [2018-10-27 06:07:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 673. [2018-10-27 06:07:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-10-27 06:07:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 744 transitions. [2018-10-27 06:07:02,642 INFO L728 BuchiCegarLoop]: Abstraction has 673 states and 744 transitions. [2018-10-27 06:07:02,642 INFO L608 BuchiCegarLoop]: Abstraction has 673 states and 744 transitions. [2018-10-27 06:07:02,642 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:07:02,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 673 states and 744 transitions. [2018-10-27 06:07:02,644 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2018-10-27 06:07:02,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:02,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:02,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:02,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:02,645 INFO L793 eck$LassoCheckResult]: Stem: 18002#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 17964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 17965#L559-2 assume true; 18062#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 18063#L550-2 main_#t~short6 := main_#t~mem4 != 0; 18054#L550-3 assume main_#t~short6; 18055#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 18046#L550-5 main_#t~short6 := main_#t~mem5 > 0; 18047#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 18038#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 18039#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 18081#L552 assume main_#t~nondet8 != 0;havoc main_#t~nondet8; 18079#L553 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 18077#L553-1 SUMMARY for call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 18076#L553-2 havoc main_#t~mem9; 18075#L554 SUMMARY for call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4); srcloc: L554 18074#L554-1 havoc main_#t~nondet10; 18070#L559-2 assume true; 18071#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 18058#L550-2 main_#t~short6 := main_#t~mem4 != 0; 18059#L550-3 assume main_#t~short6; 18050#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 18051#L550-5 main_#t~short6 := main_#t~mem5 > 0; 18042#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 18043#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 18033#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 17980#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 17981#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 18014#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 18015#L562-2 havoc main_#t~mem14; 17970#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 17971#L563-1 havoc main_#t~nondet15; 17954#L559-2 assume true; 17955#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 17948#L550-2 main_#t~short6 := main_#t~mem4 != 0; 17949#L550-3 assume main_#t~short6; 17952#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 17958#L550-5 main_#t~short6 := main_#t~mem5 > 0; 17960#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 17962#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 18008#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 18606#L552 [2018-10-27 06:07:02,645 INFO L795 eck$LassoCheckResult]: Loop: 18606#L552 assume main_#t~nondet8 != 0;havoc main_#t~nondet8; 17975#L553 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 18607#L553-1 SUMMARY for call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 18010#L553-2 havoc main_#t~mem9; 18011#L554 SUMMARY for call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4); srcloc: L554 18064#L554-1 havoc main_#t~nondet10; 18065#L559-2 assume true; 18056#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 18057#L550-2 main_#t~short6 := main_#t~mem4 != 0; 18048#L550-3 assume main_#t~short6; 18049#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 18040#L550-5 main_#t~short6 := main_#t~mem5 > 0; 18041#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 18031#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 18032#L551-1 assume main_#t~mem7 > 0;havoc main_#t~mem7; 18606#L552 [2018-10-27 06:07:02,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 961055136, now seen corresponding path program 1 times [2018-10-27 06:07:02,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:02,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:02,788 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34b6d794-7cf5-42d3-88be-11f59286f7be/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:02,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:02,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:02,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:07:02,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:07:02,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-10-27 06:07:02,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 06:07:02,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:07:02,942 INFO L477 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 19 treesize of output 20 [2018-10-27 06:07:02,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:07:02,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:02,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-10-27 06:07:02,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-10-27 06:07:03,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 11 [2018-10-27 06:07:03,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:03,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:03,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:03,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-10-27 06:07:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:03,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:03,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-10-27 06:07:03,034 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:03,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1397936049, now seen corresponding path program 2 times [2018-10-27 06:07:03,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:03,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,190 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-27 06:07:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 06:07:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-10-27 06:07:03,211 INFO L87 Difference]: Start difference. First operand 673 states and 744 transitions. cyclomatic complexity: 94 Second operand 17 states. [2018-10-27 06:07:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:03,431 INFO L93 Difference]: Finished difference Result 434 states and 476 transitions. [2018-10-27 06:07:03,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:07:03,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 476 transitions. [2018-10-27 06:07:03,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:07:03,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 156 states and 166 transitions. [2018-10-27 06:07:03,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-10-27 06:07:03,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-10-27 06:07:03,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 166 transitions. [2018-10-27 06:07:03,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:03,437 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 166 transitions. [2018-10-27 06:07:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 166 transitions. [2018-10-27 06:07:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 119. [2018-10-27 06:07:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-27 06:07:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-10-27 06:07:03,439 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-10-27 06:07:03,439 INFO L608 BuchiCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-10-27 06:07:03,439 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:07:03,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 127 transitions. [2018-10-27 06:07:03,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:07:03,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:03,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:03,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:03,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:03,449 INFO L793 eck$LassoCheckResult]: Stem: 19226#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 19224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 19225#L559-2 assume true; 19261#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 19260#L550-2 main_#t~short6 := main_#t~mem4 != 0; 19259#L550-3 assume main_#t~short6; 19258#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 19257#L550-5 main_#t~short6 := main_#t~mem5 > 0; 19256#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 19255#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 19254#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 19249#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 19250#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 19301#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 19300#L562-2 havoc main_#t~mem14; 19298#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 19296#L563-1 havoc main_#t~nondet15; 19294#L559-2 assume true; 19217#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 19207#L550-2 main_#t~short6 := main_#t~mem4 != 0; 19208#L550-3 assume main_#t~short6; 19215#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 19219#L550-5 main_#t~short6 := main_#t~mem5 > 0; 19221#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 19223#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 19237#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 19243#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 19246#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 19247#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 19211#L560-2 havoc main_#t~mem13; 19212#L559-2 assume true; 19319#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 19317#L550-2 main_#t~short6 := main_#t~mem4 != 0; 19315#L550-3 assume main_#t~short6; 19313#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 19309#L550-5 main_#t~short6 := main_#t~mem5 > 0; 19307#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 19305#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 19303#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 19252#L559 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 19253#L562 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L562 19238#L562-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 19239#L562-2 havoc main_#t~mem14; 19227#L563 SUMMARY for call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4); srcloc: L563 19228#L563-1 havoc main_#t~nondet15; 19210#L559-2 [2018-10-27 06:07:03,449 INFO L795 eck$LassoCheckResult]: Loop: 19210#L559-2 assume true; 19216#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 19205#L550-2 main_#t~short6 := main_#t~mem4 != 0; 19206#L550-3 assume main_#t~short6; 19214#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 19218#L550-5 main_#t~short6 := main_#t~mem5 > 0; 19220#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4; 19222#L551 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 19236#L551-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 19242#L559 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 19244#L560 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 19245#L560-1 SUMMARY for call write~int(main_#t~mem13 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 19209#L560-2 havoc main_#t~mem13; 19210#L559-2 [2018-10-27 06:07:03,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash 795201028, now seen corresponding path program 6 times [2018-10-27 06:07:03,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1362123108, now seen corresponding path program 4 times [2018-10-27 06:07:03,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:03,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:03,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:03,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 734177345, now seen corresponding path program 7 times [2018-10-27 06:07:03,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:03,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:03,957 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-27 06:07:04,718 WARN L179 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 146 [2018-10-27 06:07:04,842 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-10-27 06:07:04,845 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:04,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:04,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:04,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:04,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:04,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:04,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:04,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:04,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration15_Lasso [2018-10-27 06:07:04,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:04,845 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:04,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:04,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,074 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-10-27 06:07:05,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:05,527 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:05,527 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:05,527 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-10-27 06:07:05,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,530 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-10-27 06:07:05,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,544 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-10-27 06:07:05,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:05,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:05,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:05,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,546 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-10-27 06:07:05,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:05,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:05,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:05,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,548 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-10-27 06:07:05,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:05,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:05,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:05,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,556 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-10-27 06:07:05,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:05,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:05,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:05,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,558 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-10-27 06:07:05,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,561 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-10-27 06:07:05,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:05,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:05,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:05,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,562 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-10-27 06:07:05,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:05,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:05,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:05,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,572 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-10-27 06:07:05,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,578 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-10-27 06:07:05,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,581 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-10-27 06:07:05,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,581 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:05,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,582 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:05,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,598 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-10-27 06:07:05,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:05,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,621 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:05,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,622 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:05,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,632 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-10-27 06:07:05,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:05,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:05,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,650 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-10-27 06:07:05,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,654 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-10-27 06:07:05,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:05,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:05,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:05,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:05,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:05,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:05,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:05,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:05,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:05,669 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:05,669 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:05,670 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:05,670 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:05,671 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:05,671 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_11) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_11 Supporting invariants [] [2018-10-27 06:07:06,064 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:07:06,080 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:06,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:06,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:06,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-10-27 06:07:06,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-10-27 06:07:06,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-10-27 06:07:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:06,203 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-10-27 06:07:06,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 127 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-10-27 06:07:06,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 127 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 160 states and 172 transitions. Complement of second has 11 states. [2018-10-27 06:07:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-10-27 06:07:06,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 45 letters. Loop has 13 letters. [2018-10-27 06:07:06,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:06,249 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:06,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:06,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:06,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-10-27 06:07:06,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-10-27 06:07:06,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-10-27 06:07:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:06,345 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-10-27 06:07:06,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 127 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-10-27 06:07:06,384 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 127 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 160 states and 172 transitions. Complement of second has 11 states. [2018-10-27 06:07:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-10-27 06:07:06,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 45 letters. Loop has 13 letters. [2018-10-27 06:07:06,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:06,386 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:06,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:06,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:06,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-10-27 06:07:06,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-10-27 06:07:06,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:06,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-10-27 06:07:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:06,763 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-10-27 06:07:06,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 127 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-10-27 06:07:06,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 127 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 191 states and 207 transitions. Complement of second has 10 states. [2018-10-27 06:07:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2018-10-27 06:07:06,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 45 letters. Loop has 13 letters. [2018-10-27 06:07:06,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:06,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 58 letters. Loop has 13 letters. [2018-10-27 06:07:06,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:06,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 45 letters. Loop has 26 letters. [2018-10-27 06:07:06,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:06,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 207 transitions. [2018-10-27 06:07:06,794 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:06,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 0 states and 0 transitions. [2018-10-27 06:07:06,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:06,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:06,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:06,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:06,795 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:06,795 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:06,795 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:06,795 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:07:06,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:06,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:06,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:06,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:06 BoogieIcfgContainer [2018-10-27 06:07:06,802 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:06,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:06,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:06,803 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:06,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:37" (3/4) ... [2018-10-27 06:07:06,807 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:06,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:06,808 INFO L168 Benchmark]: Toolchain (without parser) took 30261.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 955.8 MB in the beginning and 1.3 GB in the end (delta: -330.6 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:06,808 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:06,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.51 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 928.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:06,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:06,809 INFO L168 Benchmark]: Boogie Preprocessor took 20.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:06,809 INFO L168 Benchmark]: RCFGBuilder took 515.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:06,810 INFO L168 Benchmark]: BuchiAutomizer took 29275.13 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -200.1 MB). Peak memory consumption was 164.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:06,810 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 226.6 kB). Peak memory consumption was 226.6 kB. Max. memory is 11.5 GB. [2018-10-27 06:07:06,812 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.51 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 928.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 515.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29275.13 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -200.1 MB). Peak memory consumption was 164.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 226.6 kB). Peak memory consumption was 226.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (4 trivial, 9 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 10 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.2s and 16 iterations. TraceHistogramMax:3. Analysis of lassos took 21.1s. Construction of modules took 1.5s. Büchi inclusion checks took 6.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 853 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 975 states and ocurred in iteration 9. Nontrivial modules had stage [8, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 633 SDtfs, 830 SDslu, 914 SDs, 0 SdLazy, 1363 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso11 LassoPreprocessingBenchmarks: Lassos: inital255 mio100 ax107 hnf100 lsp88 ukn76 mio100 lsp38 div100 bol100 ite100 ukn100 eq188 hnf88 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...