./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/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 32bit --witnessprinter.graph.data.programhash e655d34f6b59f7cc9a55d4dc4dc525a41685abad .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:08:18,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:18,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:18,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:18,463 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:18,464 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:18,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:18,466 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:18,467 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:18,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:18,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:18,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:18,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:18,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:18,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:18,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:18,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:18,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:18,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:18,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:18,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:18,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:18,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:18,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:18,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:18,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:18,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:18,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:18,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:18,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:18,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:18,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:18,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:18,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:18,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:18,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:18,502 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:08:18,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:18,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:18,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:18,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:18,516 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:18,516 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:18,516 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:18,516 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:18,516 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:18,516 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:18,516 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:18,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:18,517 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:08:18,517 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:18,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:18,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:08:18,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:18,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:18,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:18,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:18,518 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:08:18,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:18,518 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:18,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:18,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:18,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:18,521 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:18,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:18,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:18,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:18,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:18,522 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_484159c4-eeec-4a87-8983-f0c34fe8e600/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e655d34f6b59f7cc9a55d4dc4dc525a41685abad [2018-10-27 06:08:18,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:18,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:18,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:18,564 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:18,565 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:18,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-10-27 06:08:18,606 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/data/dc5d6d024/afb0221192de4bc4bb58a71ccfeedf0f/FLAG00f046599 [2018-10-27 06:08:18,973 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:18,973 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-10-27 06:08:18,979 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/data/dc5d6d024/afb0221192de4bc4bb58a71ccfeedf0f/FLAG00f046599 [2018-10-27 06:08:18,992 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/data/dc5d6d024/afb0221192de4bc4bb58a71ccfeedf0f [2018-10-27 06:08:18,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:18,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:18,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:18,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:19,000 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:19,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:18" (1/1) ... [2018-10-27 06:08:19,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4f184d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19, skipping insertion in model container [2018-10-27 06:08:19,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:18" (1/1) ... [2018-10-27 06:08:19,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:19,038 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:19,187 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:19,191 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:19,208 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:19,222 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:19,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19 WrapperNode [2018-10-27 06:08:19,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:19,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:19,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:19,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:19,234 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:08:19" (1/1) ... [2018-10-27 06:08:19,243 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:08:19" (1/1) ... [2018-10-27 06:08:19,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:19,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:19,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:19,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:19,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:19,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:19,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:19,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:19,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:19,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:19,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:19,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:19,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:19,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:19,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:19,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/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:08:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:19,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:19,896 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:19,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:19 BoogieIcfgContainer [2018-10-27 06:08:19,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:19,897 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:19,897 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:19,901 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:19,901 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:19,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:18" (1/3) ... [2018-10-27 06:08:19,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41b6fdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:19, skipping insertion in model container [2018-10-27 06:08:19,903 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:19,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:19" (2/3) ... [2018-10-27 06:08:19,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41b6fdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:19, skipping insertion in model container [2018-10-27 06:08:19,903 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:19,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:19" (3/3) ... [2018-10-27 06:08:19,905 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-10-27 06:08:19,959 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:19,960 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:19,960 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:19,960 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:19,960 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:19,960 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:19,961 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:19,961 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:19,961 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:19,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-10-27 06:08:20,004 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-10-27 06:08:20,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:20,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:20,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:20,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:20,014 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:20,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-10-27 06:08:20,016 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-10-27 06:08:20,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:20,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:20,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:08:20,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:20,029 INFO L793 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 14#L19-4true [2018-10-27 06:08:20,029 INFO L795 eck$LassoCheckResult]: Loop: 14#L19-4true assume true; 24#L19-1true assume !!(main_~i~0 < 5); 5#L20true SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4#L20-1true havoc main_#t~nondet2; 17#L19-3true main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 14#L19-4true [2018-10-27 06:08:20,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:08:20,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:20,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,145 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-10-27 06:08:20,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:20,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:20,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-10-27 06:08:20,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:20,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:20,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:20,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:20,512 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 06:08:20,596 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:20,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:20,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:20,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:20,597 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:20,597 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:20,597 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:20,598 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:20,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-10-27 06:08:20,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:20,598 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:20,619 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:08:20,622 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:08:20,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,650 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:08:20,835 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 06:08:20,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:08:20,855 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:08:20,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:08:20,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:08:20,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:08:20,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:08:20,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:08:20,877 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:08:20,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:08:20,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,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:08:20,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,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:08:20,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,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:08:20,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,894 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:08:21,063 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:08:21,446 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:21,449 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:21,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:21,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:21,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:21,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:21,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:21,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:21,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:21,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:21,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:21,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:21,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:21,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:21,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:21,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,503 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:21,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,507 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:21,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:21,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:21,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:21,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:21,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:21,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:21,585 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:21,585 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:08:21,588 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:21,589 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:21,590 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:21,590 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2018-10-27 06:08:21,615 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:08:21,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:21,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:21,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:21,701 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:08:21,715 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:21,716 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states. Second operand 4 states. [2018-10-27 06:08:21,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states.. Second operand 4 states. Result 78 states and 105 transitions. Complement of second has 8 states. [2018-10-27 06:08:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-10-27 06:08:21,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 5 letters. [2018-10-27 06:08:21,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:21,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:08:21,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:21,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 10 letters. [2018-10-27 06:08:21,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:21,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 105 transitions. [2018-10-27 06:08:21,797 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:21,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 31 states and 40 transitions. [2018-10-27 06:08:21,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-10-27 06:08:21,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:08:21,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-10-27 06:08:21,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:21,804 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-10-27 06:08:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-10-27 06:08:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-27 06:08:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 06:08:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2018-10-27 06:08:21,828 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-10-27 06:08:21,829 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-10-27 06:08:21,829 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:21,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2018-10-27 06:08:21,830 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:21,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:21,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:21,830 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:08:21,830 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:21,831 INFO L793 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 179#L19-4 assume true; 189#L19-1 assume !(main_~i~0 < 5); 201#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 182#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 183#L23-4 [2018-10-27 06:08:21,832 INFO L795 eck$LassoCheckResult]: Loop: 183#L23-4 assume true; 184#L23-1 assume !!(main_~i~0 < 5); 185#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 205#L24-1 havoc main_#t~nondet5; 203#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 183#L23-4 [2018-10-27 06:08:21,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash 889538731, now seen corresponding path program 1 times [2018-10-27 06:08:21,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:21,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:21,888 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:08:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:21,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:21,890 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:21,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash 55504638, now seen corresponding path program 1 times [2018-10-27 06:08:21,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:21,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:21,947 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-10-27 06:08:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:21,995 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-10-27 06:08:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:21,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2018-10-27 06:08:21,998 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:22,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 51 transitions. [2018-10-27 06:08:22,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-10-27 06:08:22,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:08:22,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2018-10-27 06:08:22,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:22,001 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-10-27 06:08:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2018-10-27 06:08:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2018-10-27 06:08:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 06:08:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-10-27 06:08:22,005 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-10-27 06:08:22,005 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-10-27 06:08:22,006 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:22,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-10-27 06:08:22,008 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:22,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:22,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:22,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:22,009 INFO L793 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 262#L19-4 assume true; 271#L19-1 assume !!(main_~i~0 < 5); 260#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 258#L20-1 havoc main_#t~nondet2; 259#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 272#L19-4 assume true; 273#L19-1 assume !(main_~i~0 < 5); 283#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 265#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 266#L23-4 assume true; 267#L23-1 assume !!(main_~i~0 < 5); 268#L24 [2018-10-27 06:08:22,009 INFO L795 eck$LassoCheckResult]: Loop: 268#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 289#L24-1 havoc main_#t~nondet5; 286#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 287#L23-4 assume true; 290#L23-1 assume !!(main_~i~0 < 5); 268#L24 [2018-10-27 06:08:22,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1269562707, now seen corresponding path program 1 times [2018-10-27 06:08:22,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:22,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:22,051 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/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:08:22,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:22,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:22,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 06:08:22,146 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:22,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 2 times [2018-10-27 06:08:22,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:08:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:08:22,199 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-10-27 06:08:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:22,316 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-10-27 06:08:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:22,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 68 transitions. [2018-10-27 06:08:22,318 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:22,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 67 transitions. [2018-10-27 06:08:22,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-10-27 06:08:22,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-10-27 06:08:22,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 67 transitions. [2018-10-27 06:08:22,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:22,319 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-10-27 06:08:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 67 transitions. [2018-10-27 06:08:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2018-10-27 06:08:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-27 06:08:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-10-27 06:08:22,321 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-10-27 06:08:22,321 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-10-27 06:08:22,321 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:22,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2018-10-27 06:08:22,322 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:22,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:22,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:22,323 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:22,323 INFO L793 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 400#L19-4 assume true; 409#L19-1 assume !!(main_~i~0 < 5); 435#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 434#L20-1 havoc main_#t~nondet2; 416#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 410#L19-4 assume true; 411#L19-1 assume !!(main_~i~0 < 5); 398#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 396#L20-1 havoc main_#t~nondet2; 397#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 431#L19-4 assume true; 422#L19-1 assume !(main_~i~0 < 5); 423#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 403#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 404#L23-4 assume true; 438#L23-1 assume !!(main_~i~0 < 5); 437#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 436#L24-1 havoc main_#t~nondet5; 427#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 426#L23-4 assume true; 405#L23-1 assume !!(main_~i~0 < 5); 406#L24 [2018-10-27 06:08:22,323 INFO L795 eck$LassoCheckResult]: Loop: 406#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 429#L24-1 havoc main_#t~nondet5; 430#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 433#L23-4 assume true; 432#L23-1 assume !!(main_~i~0 < 5); 406#L24 [2018-10-27 06:08:22,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1009916615, now seen corresponding path program 1 times [2018-10-27 06:08:22,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:08:22,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:22,416 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/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:08:22,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:08:22,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:22,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-27 06:08:22,499 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:22,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 3 times [2018-10-27 06:08:22,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:08:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:08:22,541 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-10-27 06:08:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:22,611 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-10-27 06:08:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:08:22,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 84 transitions. [2018-10-27 06:08:22,615 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:22,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 83 transitions. [2018-10-27 06:08:22,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-10-27 06:08:22,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-10-27 06:08:22,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 83 transitions. [2018-10-27 06:08:22,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:22,616 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-10-27 06:08:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 83 transitions. [2018-10-27 06:08:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2018-10-27 06:08:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:08:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-10-27 06:08:22,622 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-10-27 06:08:22,622 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-10-27 06:08:22,622 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:22,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2018-10-27 06:08:22,623 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:22,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:22,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:22,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:22,626 INFO L793 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 594#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 595#L19-4 assume true; 604#L19-1 assume !!(main_~i~0 < 5); 592#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 593#L20-1 havoc main_#t~nondet2; 638#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 637#L19-4 assume true; 635#L19-1 assume !!(main_~i~0 < 5); 636#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 590#L20-1 havoc main_#t~nondet2; 591#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 605#L19-4 assume true; 606#L19-1 assume !!(main_~i~0 < 5); 618#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 632#L20-1 havoc main_#t~nondet2; 628#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 627#L19-4 assume true; 616#L19-1 assume !(main_~i~0 < 5); 617#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 598#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 599#L23-4 assume true; 634#L23-1 assume !!(main_~i~0 < 5); 633#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 625#L24-1 havoc main_#t~nondet5; 622#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 623#L23-4 assume true; 642#L23-1 assume !!(main_~i~0 < 5); 641#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 640#L24-1 havoc main_#t~nondet5; 639#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 621#L23-4 assume true; 600#L23-1 assume !!(main_~i~0 < 5); 601#L24 [2018-10-27 06:08:22,626 INFO L795 eck$LassoCheckResult]: Loop: 601#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 626#L24-1 havoc main_#t~nondet5; 631#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 630#L23-4 assume true; 629#L23-1 assume !!(main_~i~0 < 5); 601#L24 [2018-10-27 06:08:22,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2044161363, now seen corresponding path program 2 times [2018-10-27 06:08:22,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:08:22,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:22,793 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/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:08:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:22,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:22,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:22,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:08:22,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:22,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-27 06:08:22,887 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:22,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,887 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 4 times [2018-10-27 06:08:22,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:08:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:08:22,926 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-10-27 06:08:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:23,119 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-10-27 06:08:23,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:08:23,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 100 transitions. [2018-10-27 06:08:23,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:23,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 90 states and 99 transitions. [2018-10-27 06:08:23,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-10-27 06:08:23,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-10-27 06:08:23,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 99 transitions. [2018-10-27 06:08:23,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:23,137 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-10-27 06:08:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 99 transitions. [2018-10-27 06:08:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-10-27 06:08:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-27 06:08:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-10-27 06:08:23,148 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-10-27 06:08:23,148 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-10-27 06:08:23,148 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:23,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 68 transitions. [2018-10-27 06:08:23,149 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:23,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:23,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:23,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-27 06:08:23,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:23,150 INFO L793 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 847#L19-4 assume true; 854#L19-1 assume !!(main_~i~0 < 5); 868#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 840#L20-1 havoc main_#t~nondet2; 841#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 855#L19-4 assume true; 856#L19-1 assume !!(main_~i~0 < 5); 842#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 843#L20-1 havoc main_#t~nondet2; 902#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 901#L19-4 assume true; 900#L19-1 assume !!(main_~i~0 < 5); 899#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 898#L20-1 havoc main_#t~nondet2; 897#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 896#L19-4 assume true; 876#L19-1 assume !!(main_~i~0 < 5); 884#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 883#L20-1 havoc main_#t~nondet2; 877#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 875#L19-4 assume true; 866#L19-1 assume !(main_~i~0 < 5); 867#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 848#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 849#L23-4 assume true; 850#L23-1 assume !!(main_~i~0 < 5); 851#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 874#L24-1 havoc main_#t~nondet5; 871#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 872#L23-4 assume true; 895#L23-1 assume !!(main_~i~0 < 5); 894#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 893#L24-1 havoc main_#t~nondet5; 892#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 891#L23-4 assume true; 890#L23-1 assume !!(main_~i~0 < 5); 889#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 888#L24-1 havoc main_#t~nondet5; 887#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 886#L23-4 assume true; 885#L23-1 assume !!(main_~i~0 < 5); 879#L24 [2018-10-27 06:08:23,150 INFO L795 eck$LassoCheckResult]: Loop: 879#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 882#L24-1 havoc main_#t~nondet5; 881#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 880#L23-4 assume true; 878#L23-1 assume !!(main_~i~0 < 5); 879#L24 [2018-10-27 06:08:23,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,160 INFO L82 PathProgramCache]: Analyzing trace with hash 333055417, now seen corresponding path program 3 times [2018-10-27 06:08:23,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:23,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 06:08:23,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:23,300 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:23,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:23,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 06:08:23,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:23,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 06:08:23,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:23,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-27 06:08:23,380 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:23,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 5 times [2018-10-27 06:08:23,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:08:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:08:23,436 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-10-27 06:08:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:23,512 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-10-27 06:08:23,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:08:23,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 110 transitions. [2018-10-27 06:08:23,514 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:23,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 99 states and 109 transitions. [2018-10-27 06:08:23,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-10-27 06:08:23,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-10-27 06:08:23,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2018-10-27 06:08:23,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:23,515 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-10-27 06:08:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2018-10-27 06:08:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2018-10-27 06:08:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-27 06:08:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-10-27 06:08:23,521 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-10-27 06:08:23,521 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-10-27 06:08:23,521 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:23,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 78 transitions. [2018-10-27 06:08:23,522 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:23,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:23,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:23,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2018-10-27 06:08:23,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:23,523 INFO L793 eck$LassoCheckResult]: Stem: 1174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1144#L19-4 assume true; 1153#L19-1 assume !!(main_~i~0 < 5); 1142#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1140#L20-1 havoc main_#t~nondet2; 1141#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1154#L19-4 assume true; 1155#L19-1 assume !!(main_~i~0 < 5); 1169#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1212#L20-1 havoc main_#t~nondet2; 1160#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1161#L19-4 assume true; 1211#L19-1 assume !!(main_~i~0 < 5); 1210#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1209#L20-1 havoc main_#t~nondet2; 1208#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1207#L19-4 assume true; 1206#L19-1 assume !!(main_~i~0 < 5); 1205#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1204#L20-1 havoc main_#t~nondet2; 1203#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1201#L19-4 assume true; 1178#L19-1 assume !!(main_~i~0 < 5); 1186#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1185#L20-1 havoc main_#t~nondet2; 1179#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1177#L19-4 assume true; 1167#L19-1 assume !(main_~i~0 < 5); 1168#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 1147#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 1148#L23-4 assume true; 1202#L23-1 assume !!(main_~i~0 < 5); 1176#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1175#L24-1 havoc main_#t~nondet5; 1173#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1172#L23-4 assume true; 1149#L23-1 assume !!(main_~i~0 < 5); 1150#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1200#L24-1 havoc main_#t~nondet5; 1199#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1198#L23-4 assume true; 1197#L23-1 assume !!(main_~i~0 < 5); 1196#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1195#L24-1 havoc main_#t~nondet5; 1194#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1193#L23-4 assume true; 1192#L23-1 assume !!(main_~i~0 < 5); 1191#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1190#L24-1 havoc main_#t~nondet5; 1189#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1188#L23-4 assume true; 1187#L23-1 assume !!(main_~i~0 < 5); 1181#L24 [2018-10-27 06:08:23,524 INFO L795 eck$LassoCheckResult]: Loop: 1181#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1184#L24-1 havoc main_#t~nondet5; 1183#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1182#L23-4 assume true; 1180#L23-1 assume !!(main_~i~0 < 5); 1181#L24 [2018-10-27 06:08:23,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1493339475, now seen corresponding path program 4 times [2018-10-27 06:08:23,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 6 times [2018-10-27 06:08:23,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:23,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:23,573 INFO L82 PathProgramCache]: Analyzing trace with hash 589260054, now seen corresponding path program 5 times [2018-10-27 06:08:23,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:23,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:23,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:23,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 42 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 06:08:23,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:23,710 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:23,730 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:08:23,832 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-27 06:08:23,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:23,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 06:08:24,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:08:24,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-10-27 06:08:24,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 06:08:24,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-27 06:08:24,065 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-10-27 06:08:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:24,207 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-10-27 06:08:24,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:08:24,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 113 transitions. [2018-10-27 06:08:24,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-10-27 06:08:24,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 103 states and 112 transitions. [2018-10-27 06:08:24,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-10-27 06:08:24,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2018-10-27 06:08:24,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 112 transitions. [2018-10-27 06:08:24,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:24,210 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-10-27 06:08:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 112 transitions. [2018-10-27 06:08:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2018-10-27 06:08:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-27 06:08:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-10-27 06:08:24,215 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-10-27 06:08:24,215 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-10-27 06:08:24,215 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:24,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 76 transitions. [2018-10-27 06:08:24,216 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-10-27 06:08:24,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:24,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:24,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:24,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:08:24,217 INFO L793 eck$LassoCheckResult]: Stem: 1538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1514#L19-4 assume true; 1523#L19-1 assume !!(main_~i~0 < 5); 1512#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1510#L20-1 havoc main_#t~nondet2; 1511#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1528#L19-4 assume true; 1578#L19-1 assume !!(main_~i~0 < 5); 1576#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1574#L20-1 havoc main_#t~nondet2; 1572#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1570#L19-4 assume true; 1568#L19-1 assume !!(main_~i~0 < 5); 1566#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1564#L20-1 havoc main_#t~nondet2; 1562#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1560#L19-4 assume true; 1558#L19-1 assume !!(main_~i~0 < 5); 1556#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1554#L20-1 havoc main_#t~nondet2; 1552#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1550#L19-4 assume true; 1548#L19-1 assume !!(main_~i~0 < 5); 1546#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1544#L20-1 havoc main_#t~nondet2; 1543#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1542#L19-4 assume true; 1541#L19-1 assume !(main_~i~0 < 5); 1540#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 1517#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 1518#L23-4 assume true; 1519#L23-1 assume !!(main_~i~0 < 5); 1520#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1539#L24-1 havoc main_#t~nondet5; 1536#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1537#L23-4 assume true; 1582#L23-1 assume !!(main_~i~0 < 5); 1581#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1580#L24-1 havoc main_#t~nondet5; 1579#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1577#L23-4 assume true; 1575#L23-1 assume !!(main_~i~0 < 5); 1573#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1571#L24-1 havoc main_#t~nondet5; 1569#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1567#L23-4 assume true; 1565#L23-1 assume !!(main_~i~0 < 5); 1563#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1561#L24-1 havoc main_#t~nondet5; 1559#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1557#L23-4 assume true; 1555#L23-1 assume !!(main_~i~0 < 5); 1553#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1551#L24-1 havoc main_#t~nondet5; 1549#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1547#L23-4 assume true; 1545#L23-1 assume !(main_~i~0 < 5); 1534#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 1521#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 1522#L28-4 [2018-10-27 06:08:24,217 INFO L795 eck$LassoCheckResult]: Loop: 1522#L28-4 assume true; 1529#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 1524#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 1522#L28-4 [2018-10-27 06:08:24,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -656771783, now seen corresponding path program 1 times [2018-10-27 06:08:24,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:24,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:24,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 79510, now seen corresponding path program 1 times [2018-10-27 06:08:24,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:24,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:24,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:24,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:24,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1982862942, now seen corresponding path program 1 times [2018-10-27 06:08:24,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:24,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:26,885 WARN L179 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 223 DAG size of output: 169 [2018-10-27 06:08:27,000 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-27 06:08:27,003 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:27,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:27,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:27,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:27,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:27,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:27,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:27,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:27,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration8_Lasso [2018-10-27 06:08:27,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:27,004 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:27,007 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:08:27,011 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:08:27,012 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:08:27,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,017 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:08:27,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,020 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:08:27,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,024 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:08:27,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:27,220 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:08:27,221 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:08:27,222 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:08:27,223 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:08:27,228 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:08:27,230 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:08:27,453 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:27,453 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:27,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,529 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:27,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,530 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:27,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,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:08:27,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:27,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:27,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:27,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,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:08:27,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:27,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:27,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:27,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:27,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:27,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:27,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:27,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:27,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:27,610 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:27,610 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:27,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:27,612 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:27,612 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:27,612 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~nc_A~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-10-27 06:08:27,868 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-10-27 06:08:27,884 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:28,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:28,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:28,261 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:08:28,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:28,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-10-27 06:08:28,286 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 86 states and 93 transitions. Complement of second has 6 states. [2018-10-27 06:08:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-10-27 06:08:28,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 60 letters. Loop has 3 letters. [2018-10-27 06:08:28,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:28,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 63 letters. Loop has 3 letters. [2018-10-27 06:08:28,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:28,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 60 letters. Loop has 6 letters. [2018-10-27 06:08:28,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:28,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 93 transitions. [2018-10-27 06:08:28,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-10-27 06:08:28,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 76 states and 80 transitions. [2018-10-27 06:08:28,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-10-27 06:08:28,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-10-27 06:08:28,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 80 transitions. [2018-10-27 06:08:28,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:28,291 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-10-27 06:08:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 80 transitions. [2018-10-27 06:08:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-27 06:08:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 06:08:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-10-27 06:08:28,294 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-10-27 06:08:28,294 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-10-27 06:08:28,294 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:08:28,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 80 transitions. [2018-10-27 06:08:28,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-10-27 06:08:28,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:28,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:28,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:28,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:08:28,298 INFO L793 eck$LassoCheckResult]: Stem: 1954#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1924#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1925#L19-4 assume true; 1992#L19-1 assume !!(main_~i~0 < 5); 1990#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1989#L20-1 havoc main_#t~nondet2; 1942#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1934#L19-4 assume true; 1935#L19-1 assume !!(main_~i~0 < 5); 1923#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1921#L20-1 havoc main_#t~nondet2; 1922#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1985#L19-4 assume true; 1983#L19-1 assume !!(main_~i~0 < 5); 1981#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1979#L20-1 havoc main_#t~nondet2; 1977#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1975#L19-4 assume true; 1973#L19-1 assume !!(main_~i~0 < 5); 1971#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1969#L20-1 havoc main_#t~nondet2; 1967#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1965#L19-4 assume true; 1963#L19-1 assume !!(main_~i~0 < 5); 1962#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 1961#L20-1 havoc main_#t~nondet2; 1960#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1959#L19-4 assume true; 1958#L19-1 assume !(main_~i~0 < 5); 1957#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 1928#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 1929#L23-4 assume true; 1951#L23-1 assume !!(main_~i~0 < 5); 1956#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1955#L24-1 havoc main_#t~nondet5; 1952#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1953#L23-4 assume true; 1996#L23-1 assume !!(main_~i~0 < 5); 1995#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1994#L24-1 havoc main_#t~nondet5; 1993#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1991#L23-4 assume true; 1930#L23-1 assume !!(main_~i~0 < 5); 1931#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1988#L24-1 havoc main_#t~nondet5; 1987#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1986#L23-4 assume true; 1984#L23-1 assume !!(main_~i~0 < 5); 1982#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1980#L24-1 havoc main_#t~nondet5; 1978#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1976#L23-4 assume true; 1974#L23-1 assume !!(main_~i~0 < 5); 1972#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 1970#L24-1 havoc main_#t~nondet5; 1968#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1966#L23-4 assume true; 1964#L23-1 assume !(main_~i~0 < 5); 1949#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 1932#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 1933#L28-4 assume true; 1943#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 1936#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 1937#L28-5 main_~nc_B~0 := 0; 1947#L32-4 [2018-10-27 06:08:28,298 INFO L795 eck$LassoCheckResult]: Loop: 1947#L32-4 assume true; 1926#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 1927#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 1947#L32-4 [2018-10-27 06:08:28,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1339209057, now seen corresponding path program 1 times [2018-10-27 06:08:28,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:28,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:28,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash 94405, now seen corresponding path program 1 times [2018-10-27 06:08:28,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash 425869157, now seen corresponding path program 1 times [2018-10-27 06:08:28,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:28,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:28,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:28,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:28,548 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 06:08:28,715 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 06:08:31,593 WARN L179 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 234 DAG size of output: 176 [2018-10-27 06:08:31,693 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:31,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:31,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:31,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:31,694 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:31,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:31,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:31,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:31,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-10-27 06:08:31,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:31,694 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:31,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:08:31,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:08:31,706 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:08:31,707 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:08:31,708 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:08:31,709 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:08:31,710 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:08:31,712 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:08:31,713 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:08:31,716 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:08:31,717 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:08:31,719 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:08:31,720 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:08:31,721 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:08:31,722 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:08:31,724 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:08:31,730 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:08:31,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,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:08:32,141 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:32,141 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:32,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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:08:32,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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:08:32,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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:08:32,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,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:08:32,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,229 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:32,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:32,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,231 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,244 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:32,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,245 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:32,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,249 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:32,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,250 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:08:32,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:32,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,287 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:32,299 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:08:32,299 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:08:32,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:32,303 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:32,303 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:32,303 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_1, ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_1 - 1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2018-10-27 06:08:32,496 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-10-27 06:08:32,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:32,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:32,601 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:08:32,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:32,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 80 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-10-27 06:08:32,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 80 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 85 states and 92 transitions. Complement of second has 6 states. [2018-10-27 06:08:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-10-27 06:08:32,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 64 letters. Loop has 3 letters. [2018-10-27 06:08:32,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:32,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 67 letters. Loop has 3 letters. [2018-10-27 06:08:32,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:32,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 64 letters. Loop has 6 letters. [2018-10-27 06:08:32,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:32,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:08:32,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:32,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 79 states and 84 transitions. [2018-10-27 06:08:32,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-10-27 06:08:32,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-10-27 06:08:32,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 84 transitions. [2018-10-27 06:08:32,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:32,652 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-10-27 06:08:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 84 transitions. [2018-10-27 06:08:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-27 06:08:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 06:08:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-10-27 06:08:32,659 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-10-27 06:08:32,659 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-10-27 06:08:32,659 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:08:32,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 84 transitions. [2018-10-27 06:08:32,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:32,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:32,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:32,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:32,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:32,667 INFO L793 eck$LassoCheckResult]: Stem: 2368#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2341#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2342#L19-4 assume true; 2349#L19-1 assume !!(main_~i~0 < 5); 2336#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2334#L20-1 havoc main_#t~nondet2; 2335#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2356#L19-4 assume true; 2403#L19-1 assume !!(main_~i~0 < 5); 2401#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2399#L20-1 havoc main_#t~nondet2; 2397#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2395#L19-4 assume true; 2393#L19-1 assume !!(main_~i~0 < 5); 2391#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2389#L20-1 havoc main_#t~nondet2; 2387#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2385#L19-4 assume true; 2383#L19-1 assume !!(main_~i~0 < 5); 2381#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2379#L20-1 havoc main_#t~nondet2; 2378#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2377#L19-4 assume true; 2376#L19-1 assume !!(main_~i~0 < 5); 2375#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2374#L20-1 havoc main_#t~nondet2; 2373#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2372#L19-4 assume true; 2371#L19-1 assume !(main_~i~0 < 5); 2370#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 2343#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 2344#L23-4 assume true; 2345#L23-1 assume !!(main_~i~0 < 5); 2346#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2369#L24-1 havoc main_#t~nondet5; 2366#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2367#L23-4 assume true; 2412#L23-1 assume !!(main_~i~0 < 5); 2411#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2410#L24-1 havoc main_#t~nondet5; 2409#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2408#L23-4 assume true; 2407#L23-1 assume !!(main_~i~0 < 5); 2406#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2405#L24-1 havoc main_#t~nondet5; 2404#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2402#L23-4 assume true; 2400#L23-1 assume !!(main_~i~0 < 5); 2398#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2396#L24-1 havoc main_#t~nondet5; 2394#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2392#L23-4 assume true; 2390#L23-1 assume !!(main_~i~0 < 5); 2388#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2386#L24-1 havoc main_#t~nondet5; 2384#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2382#L23-4 assume true; 2380#L23-1 assume !(main_~i~0 < 5); 2364#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 2347#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 2348#L28-4 assume true; 2358#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 2350#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 2351#L28-5 main_~nc_B~0 := 0; 2361#L32-4 assume true; 2337#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 2338#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 2357#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2354#L41-4 [2018-10-27 06:08:32,667 INFO L795 eck$LassoCheckResult]: Loop: 2354#L41-4 assume true; 2355#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 2360#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 2365#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 2363#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 2354#L41-4 [2018-10-27 06:08:32,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,667 INFO L82 PathProgramCache]: Analyzing trace with hash 317041997, now seen corresponding path program 1 times [2018-10-27 06:08:32,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 1 times [2018-10-27 06:08:32,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1295148115, now seen corresponding path program 1 times [2018-10-27 06:08:32,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 06:08:32,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:32,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:32,809 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:08:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:32,829 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-10-27 06:08:32,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:32,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 99 transitions. [2018-10-27 06:08:32,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:32,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 81 states and 85 transitions. [2018-10-27 06:08:32,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-10-27 06:08:32,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-10-27 06:08:32,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 85 transitions. [2018-10-27 06:08:32,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:32,831 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-10-27 06:08:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 85 transitions. [2018-10-27 06:08:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-27 06:08:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 06:08:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-10-27 06:08:32,834 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-10-27 06:08:32,834 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-10-27 06:08:32,834 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:08:32,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 83 transitions. [2018-10-27 06:08:32,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:32,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:32,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:32,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:32,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:32,836 INFO L793 eck$LassoCheckResult]: Stem: 2549#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2523#L19-4 assume true; 2530#L19-1 assume !!(main_~i~0 < 5); 2517#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2515#L20-1 havoc main_#t~nondet2; 2516#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2537#L19-4 assume true; 2586#L19-1 assume !!(main_~i~0 < 5); 2584#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2582#L20-1 havoc main_#t~nondet2; 2580#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2578#L19-4 assume true; 2576#L19-1 assume !!(main_~i~0 < 5); 2574#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2572#L20-1 havoc main_#t~nondet2; 2570#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2568#L19-4 assume true; 2566#L19-1 assume !!(main_~i~0 < 5); 2564#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2562#L20-1 havoc main_#t~nondet2; 2561#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2560#L19-4 assume true; 2559#L19-1 assume !!(main_~i~0 < 5); 2558#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2557#L20-1 havoc main_#t~nondet2; 2556#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2555#L19-4 assume true; 2554#L19-1 assume !(main_~i~0 < 5); 2553#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 2524#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 2525#L23-4 assume true; 2526#L23-1 assume !!(main_~i~0 < 5); 2527#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2550#L24-1 havoc main_#t~nondet5; 2547#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2548#L23-4 assume true; 2593#L23-1 assume !!(main_~i~0 < 5); 2551#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2552#L24-1 havoc main_#t~nondet5; 2592#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2591#L23-4 assume true; 2590#L23-1 assume !!(main_~i~0 < 5); 2589#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2588#L24-1 havoc main_#t~nondet5; 2587#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2585#L23-4 assume true; 2583#L23-1 assume !!(main_~i~0 < 5); 2581#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2579#L24-1 havoc main_#t~nondet5; 2577#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2575#L23-4 assume true; 2573#L23-1 assume !!(main_~i~0 < 5); 2571#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2569#L24-1 havoc main_#t~nondet5; 2567#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2565#L23-4 assume true; 2563#L23-1 assume !(main_~i~0 < 5); 2545#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 2528#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 2529#L28-4 assume true; 2539#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 2533#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 2534#L28-4 assume true; 2538#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 2531#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 2532#L28-5 main_~nc_B~0 := 0; 2542#L32-4 assume true; 2518#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 2519#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 2540#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2535#L41-4 [2018-10-27 06:08:32,836 INFO L795 eck$LassoCheckResult]: Loop: 2535#L41-4 assume true; 2536#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 2541#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 2546#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 2544#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 2535#L41-4 [2018-10-27 06:08:32,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash 49174898, now seen corresponding path program 1 times [2018-10-27 06:08:32,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 06:08:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:32,948 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:32,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 06:08:33,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:08:33,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-10-27 06:08:33,021 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:33,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,021 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 2 times [2018-10-27 06:08:33,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:08:33,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:08:33,126 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. cyclomatic complexity: 7 Second operand 9 states. [2018-10-27 06:08:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:33,157 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-10-27 06:08:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:08:33,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 89 transitions. [2018-10-27 06:08:33,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:33,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 83 states and 86 transitions. [2018-10-27 06:08:33,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-10-27 06:08:33,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-10-27 06:08:33,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 86 transitions. [2018-10-27 06:08:33,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:33,160 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-10-27 06:08:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 86 transitions. [2018-10-27 06:08:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-10-27 06:08:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-27 06:08:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-10-27 06:08:33,162 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-10-27 06:08:33,162 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-10-27 06:08:33,162 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:08:33,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 82 transitions. [2018-10-27 06:08:33,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:33,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:33,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:33,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:33,170 INFO L793 eck$LassoCheckResult]: Stem: 2938#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2908#L19-4 assume true; 2919#L19-1 assume !!(main_~i~0 < 5); 2906#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2904#L20-1 havoc main_#t~nondet2; 2905#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2926#L19-4 assume true; 2974#L19-1 assume !!(main_~i~0 < 5); 2972#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2970#L20-1 havoc main_#t~nondet2; 2968#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2966#L19-4 assume true; 2964#L19-1 assume !!(main_~i~0 < 5); 2962#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2960#L20-1 havoc main_#t~nondet2; 2958#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2956#L19-4 assume true; 2954#L19-1 assume !!(main_~i~0 < 5); 2952#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2950#L20-1 havoc main_#t~nondet2; 2948#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2947#L19-4 assume true; 2946#L19-1 assume !!(main_~i~0 < 5); 2945#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 2944#L20-1 havoc main_#t~nondet2; 2943#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2942#L19-4 assume true; 2941#L19-1 assume !(main_~i~0 < 5); 2940#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 2913#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 2914#L23-4 assume true; 2915#L23-1 assume !!(main_~i~0 < 5); 2916#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2939#L24-1 havoc main_#t~nondet5; 2936#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2937#L23-4 assume true; 2982#L23-1 assume !!(main_~i~0 < 5); 2981#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2980#L24-1 havoc main_#t~nondet5; 2979#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2978#L23-4 assume true; 2977#L23-1 assume !!(main_~i~0 < 5); 2976#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2975#L24-1 havoc main_#t~nondet5; 2973#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2971#L23-4 assume true; 2969#L23-1 assume !!(main_~i~0 < 5); 2967#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2965#L24-1 havoc main_#t~nondet5; 2963#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2961#L23-4 assume true; 2959#L23-1 assume !!(main_~i~0 < 5); 2957#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 2955#L24-1 havoc main_#t~nondet5; 2953#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2951#L23-4 assume true; 2949#L23-1 assume !(main_~i~0 < 5); 2934#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 2917#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 2918#L28-4 assume true; 2928#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 2922#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 2923#L28-4 assume true; 2927#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 2920#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 2921#L28-5 main_~nc_B~0 := 0; 2931#L32-4 assume true; 2911#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 2912#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 2932#L32-4 assume true; 2909#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 2910#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 2929#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2924#L41-4 [2018-10-27 06:08:33,170 INFO L795 eck$LassoCheckResult]: Loop: 2924#L41-4 assume true; 2925#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 2930#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 2935#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 2933#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 2924#L41-4 [2018-10-27 06:08:33,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 387005196, now seen corresponding path program 1 times [2018-10-27 06:08:33,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 3 times [2018-10-27 06:08:33,208 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1925172558, now seen corresponding path program 1 times [2018-10-27 06:08:33,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:37,361 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 271 DAG size of output: 209 [2018-10-27 06:08:37,563 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-10-27 06:08:37,565 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:37,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:37,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:37,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:37,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:37,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:37,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:37,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:37,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-10-27 06:08:37,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:37,566 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:37,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:08:37,574 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:08:37,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:08:37,577 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:08:37,578 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:08:37,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:08:37,581 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:08:37,583 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:08:37,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:08:37,585 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:08:37,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:08:37,589 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:08:37,590 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:08:37,591 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:08:38,177 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2018-10-27 06:08:38,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,259 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:08:38,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,627 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:38,627 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:38,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,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:08:38,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:38,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,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:08:38,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:38,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,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:08:38,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:38,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:38,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:38,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:38,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:38,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:38,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:38,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:38,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:38,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:38,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:38,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:38,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:38,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:38,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:38,727 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:38,770 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:08:38,773 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:08:38,774 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:38,775 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:38,775 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:38,775 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:08:39,215 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2018-10-27 06:08:39,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:39,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:39,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:39,270 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:08:39,270 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:08:39,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 82 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-10-27 06:08:39,301 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 82 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 91 states and 96 transitions. Complement of second has 8 states. [2018-10-27 06:08:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-10-27 06:08:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:08:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-10-27 06:08:39,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 74 letters. Loop has 5 letters. [2018-10-27 06:08:39,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:39,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 79 letters. Loop has 5 letters. [2018-10-27 06:08:39,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:39,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 74 letters. Loop has 10 letters. [2018-10-27 06:08:39,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:39,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 96 transitions. [2018-10-27 06:08:39,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:39,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 87 states and 91 transitions. [2018-10-27 06:08:39,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-10-27 06:08:39,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-10-27 06:08:39,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 91 transitions. [2018-10-27 06:08:39,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:39,304 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-10-27 06:08:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 91 transitions. [2018-10-27 06:08:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-27 06:08:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 06:08:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-10-27 06:08:39,312 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-10-27 06:08:39,312 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-10-27 06:08:39,312 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:08:39,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 89 transitions. [2018-10-27 06:08:39,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:39,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:39,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:39,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:39,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:39,314 INFO L793 eck$LassoCheckResult]: Stem: 3463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3429#L19-4 assume true; 3436#L19-1 assume !!(main_~i~0 < 5); 3457#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3487#L20-1 havoc main_#t~nondet2; 3445#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3446#L19-4 assume true; 3489#L19-1 assume !!(main_~i~0 < 5); 3423#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3421#L20-1 havoc main_#t~nondet2; 3422#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3484#L19-4 assume true; 3482#L19-1 assume !!(main_~i~0 < 5); 3481#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3480#L20-1 havoc main_#t~nondet2; 3479#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3478#L19-4 assume true; 3477#L19-1 assume !!(main_~i~0 < 5); 3476#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3475#L20-1 havoc main_#t~nondet2; 3474#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3473#L19-4 assume true; 3472#L19-1 assume !!(main_~i~0 < 5); 3471#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3470#L20-1 havoc main_#t~nondet2; 3469#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3468#L19-4 assume true; 3467#L19-1 assume !(main_~i~0 < 5); 3466#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 3430#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 3431#L23-4 assume true; 3505#L23-1 assume !!(main_~i~0 < 5); 3504#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3464#L24-1 havoc main_#t~nondet5; 3462#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3461#L23-4 assume true; 3432#L23-1 assume !!(main_~i~0 < 5); 3433#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3465#L24-1 havoc main_#t~nondet5; 3503#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3502#L23-4 assume true; 3501#L23-1 assume !!(main_~i~0 < 5); 3500#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3499#L24-1 havoc main_#t~nondet5; 3498#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3497#L23-4 assume true; 3496#L23-1 assume !!(main_~i~0 < 5); 3495#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3494#L24-1 havoc main_#t~nondet5; 3493#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3492#L23-4 assume true; 3491#L23-1 assume !!(main_~i~0 < 5); 3490#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3488#L24-1 havoc main_#t~nondet5; 3486#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3485#L23-4 assume true; 3483#L23-1 assume !(main_~i~0 < 5); 3458#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 3434#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 3435#L28-4 assume true; 3448#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 3439#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 3440#L28-4 assume true; 3447#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 3437#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 3438#L28-5 main_~nc_B~0 := 0; 3453#L32-4 assume true; 3426#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 3427#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 3454#L32-4 assume true; 3424#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 3425#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 3449#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3450#L41-4 assume true; 3444#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3452#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 3460#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 3456#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 3441#L41-4 [2018-10-27 06:08:39,314 INFO L795 eck$LassoCheckResult]: Loop: 3441#L41-4 assume true; 3442#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3451#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 3459#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 3455#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 3441#L41-4 [2018-10-27 06:08:39,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1925172556, now seen corresponding path program 1 times [2018-10-27 06:08:39,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 4 times [2018-10-27 06:08:39,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash -997022962, now seen corresponding path program 1 times [2018-10-27 06:08:39,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-27 06:08:39,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:39,791 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:39,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:39,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-27 06:08:39,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:39,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-27 06:08:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:08:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:08:40,015 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. cyclomatic complexity: 8 Second operand 9 states. [2018-10-27 06:08:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:40,051 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-10-27 06:08:40,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:08:40,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 125 transitions. [2018-10-27 06:08:40,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:40,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 115 states and 123 transitions. [2018-10-27 06:08:40,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-10-27 06:08:40,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2018-10-27 06:08:40,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 123 transitions. [2018-10-27 06:08:40,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:40,054 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-10-27 06:08:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 123 transitions. [2018-10-27 06:08:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2018-10-27 06:08:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 06:08:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-10-27 06:08:40,057 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-10-27 06:08:40,057 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-10-27 06:08:40,057 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:08:40,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 109 transitions. [2018-10-27 06:08:40,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:40,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:40,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:40,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:40,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:40,059 INFO L793 eck$LassoCheckResult]: Stem: 3928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3894#L19-4 assume true; 3901#L19-1 assume !!(main_~i~0 < 5); 3888#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3886#L20-1 havoc main_#t~nondet2; 3887#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3910#L19-4 assume true; 3971#L19-1 assume !!(main_~i~0 < 5); 3970#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3968#L20-1 havoc main_#t~nondet2; 3966#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3964#L19-4 assume true; 3962#L19-1 assume !!(main_~i~0 < 5); 3960#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3958#L20-1 havoc main_#t~nondet2; 3956#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3954#L19-4 assume true; 3952#L19-1 assume !!(main_~i~0 < 5); 3950#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3948#L20-1 havoc main_#t~nondet2; 3946#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3944#L19-4 assume true; 3942#L19-1 assume !!(main_~i~0 < 5); 3940#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 3938#L20-1 havoc main_#t~nondet2; 3936#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3934#L19-4 assume true; 3933#L19-1 assume !(main_~i~0 < 5); 3932#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 3895#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 3896#L23-4 assume true; 3973#L23-1 assume !!(main_~i~0 < 5); 3972#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3929#L24-1 havoc main_#t~nondet5; 3927#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3926#L23-4 assume true; 3897#L23-1 assume !!(main_~i~0 < 5); 3898#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3930#L24-1 havoc main_#t~nondet5; 3969#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3967#L23-4 assume true; 3965#L23-1 assume !!(main_~i~0 < 5); 3963#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3961#L24-1 havoc main_#t~nondet5; 3959#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3957#L23-4 assume true; 3955#L23-1 assume !!(main_~i~0 < 5); 3953#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3951#L24-1 havoc main_#t~nondet5; 3949#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3947#L23-4 assume true; 3945#L23-1 assume !!(main_~i~0 < 5); 3943#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 3941#L24-1 havoc main_#t~nondet5; 3939#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3937#L23-4 assume true; 3935#L23-1 assume !(main_~i~0 < 5); 3923#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 3899#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 3900#L28-4 assume true; 3931#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 3904#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 3905#L28-4 assume true; 3912#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 3913#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 3988#L28-4 assume true; 3987#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 3986#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 3985#L28-5 main_~nc_B~0 := 0; 3984#L32-4 assume true; 3982#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 3983#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 3981#L32-4 assume true; 3980#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 3979#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 3978#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3977#L41-4 assume true; 3909#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3976#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 3975#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 3974#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 3921#L41-4 [2018-10-27 06:08:40,070 INFO L795 eck$LassoCheckResult]: Loop: 3921#L41-4 assume true; 3915#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3916#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 3924#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 3920#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 3921#L41-4 [2018-10-27 06:08:40,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 629180423, now seen corresponding path program 2 times [2018-10-27 06:08:40,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 06:08:40,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:40,221 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:40,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:40,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:40,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:40,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 06:08:40,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:40,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-10-27 06:08:40,299 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:40,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 5 times [2018-10-27 06:08:40,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:40,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:08:40,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:08:40,347 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. cyclomatic complexity: 11 Second operand 13 states. [2018-10-27 06:08:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:40,520 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-10-27 06:08:40,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:08:40,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 133 transitions. [2018-10-27 06:08:40,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:40,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 130 transitions. [2018-10-27 06:08:40,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-10-27 06:08:40,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2018-10-27 06:08:40,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 130 transitions. [2018-10-27 06:08:40,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:40,524 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-10-27 06:08:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 130 transitions. [2018-10-27 06:08:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-10-27 06:08:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 06:08:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-10-27 06:08:40,526 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-10-27 06:08:40,526 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-10-27 06:08:40,526 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:08:40,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 112 transitions. [2018-10-27 06:08:40,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:40,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:40,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:40,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:40,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:40,532 INFO L793 eck$LassoCheckResult]: Stem: 4422#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4381#L19-4 assume true; 4392#L19-1 assume !!(main_~i~0 < 5); 4379#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4377#L20-1 havoc main_#t~nondet2; 4378#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4400#L19-4 assume true; 4469#L19-1 assume !!(main_~i~0 < 5); 4467#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4465#L20-1 havoc main_#t~nondet2; 4463#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4461#L19-4 assume true; 4459#L19-1 assume !!(main_~i~0 < 5); 4457#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4455#L20-1 havoc main_#t~nondet2; 4453#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4451#L19-4 assume true; 4449#L19-1 assume !!(main_~i~0 < 5); 4447#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4445#L20-1 havoc main_#t~nondet2; 4443#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4441#L19-4 assume true; 4439#L19-1 assume !!(main_~i~0 < 5); 4437#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4435#L20-1 havoc main_#t~nondet2; 4433#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4431#L19-4 assume true; 4430#L19-1 assume !(main_~i~0 < 5); 4429#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 4386#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 4387#L23-4 assume true; 4388#L23-1 assume !!(main_~i~0 < 5); 4389#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4423#L24-1 havoc main_#t~nondet5; 4420#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4421#L23-4 assume true; 4471#L23-1 assume !!(main_~i~0 < 5); 4470#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4468#L24-1 havoc main_#t~nondet5; 4466#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4464#L23-4 assume true; 4462#L23-1 assume !!(main_~i~0 < 5); 4460#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4458#L24-1 havoc main_#t~nondet5; 4456#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4454#L23-4 assume true; 4452#L23-1 assume !!(main_~i~0 < 5); 4450#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4448#L24-1 havoc main_#t~nondet5; 4446#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4444#L23-4 assume true; 4442#L23-1 assume !!(main_~i~0 < 5); 4440#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4438#L24-1 havoc main_#t~nondet5; 4436#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4434#L23-4 assume true; 4432#L23-1 assume !(main_~i~0 < 5); 4415#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 4390#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 4391#L28-4 assume true; 4426#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 4474#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 4427#L28-4 assume true; 4428#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 4393#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 4394#L28-5 main_~nc_B~0 := 0; 4409#L32-4 assume true; 4384#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 4385#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 4472#L32-4 assume true; 4382#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 4383#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 4401#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4402#L41-4 assume true; 4477#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4419#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 4417#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 4414#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 4399#L41-4 assume true; 4398#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4408#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 4476#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 4475#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 4413#L41-4 [2018-10-27 06:08:40,532 INFO L795 eck$LassoCheckResult]: Loop: 4413#L41-4 assume true; 4406#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4407#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 4416#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 4412#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 4413#L41-4 [2018-10-27 06:08:40,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash -939764662, now seen corresponding path program 2 times [2018-10-27 06:08:40,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:40,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:40,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:40,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-27 06:08:40,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:40,828 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:40,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:40,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:40,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:40,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-27 06:08:40,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:40,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-27 06:08:40,970 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:40,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,970 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 6 times [2018-10-27 06:08:40,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:40,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:08:41,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:08:41,046 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-10-27 06:08:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:41,249 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-10-27 06:08:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:08:41,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 132 transitions. [2018-10-27 06:08:41,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:41,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 99 transitions. [2018-10-27 06:08:41,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-10-27 06:08:41,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2018-10-27 06:08:41,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 99 transitions. [2018-10-27 06:08:41,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:41,253 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-10-27 06:08:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 99 transitions. [2018-10-27 06:08:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-10-27 06:08:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-27 06:08:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-10-27 06:08:41,255 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-10-27 06:08:41,255 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-10-27 06:08:41,255 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:08:41,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 95 transitions. [2018-10-27 06:08:41,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:08:41,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:41,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:41,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:41,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:41,257 INFO L793 eck$LassoCheckResult]: Stem: 4929#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4888#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4889#L19-4 assume true; 4967#L19-1 assume !!(main_~i~0 < 5); 4965#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4963#L20-1 havoc main_#t~nondet2; 4909#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4900#L19-4 assume true; 4901#L19-1 assume !!(main_~i~0 < 5); 4887#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4885#L20-1 havoc main_#t~nondet2; 4886#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4960#L19-4 assume true; 4958#L19-1 assume !!(main_~i~0 < 5); 4956#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4954#L20-1 havoc main_#t~nondet2; 4952#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4950#L19-4 assume true; 4948#L19-1 assume !!(main_~i~0 < 5); 4946#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4944#L20-1 havoc main_#t~nondet2; 4942#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4941#L19-4 assume true; 4940#L19-1 assume !!(main_~i~0 < 5); 4939#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 4938#L20-1 havoc main_#t~nondet2; 4937#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4936#L19-4 assume true; 4935#L19-1 assume !(main_~i~0 < 5); 4933#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 4894#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 4895#L23-4 assume true; 4925#L23-1 assume !!(main_~i~0 < 5); 4973#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4930#L24-1 havoc main_#t~nondet5; 4927#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4928#L23-4 assume true; 4896#L23-1 assume !!(main_~i~0 < 5); 4897#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4931#L24-1 havoc main_#t~nondet5; 4972#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4971#L23-4 assume true; 4970#L23-1 assume !!(main_~i~0 < 5); 4969#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4968#L24-1 havoc main_#t~nondet5; 4966#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4964#L23-4 assume true; 4962#L23-1 assume !!(main_~i~0 < 5); 4961#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4959#L24-1 havoc main_#t~nondet5; 4957#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4955#L23-4 assume true; 4953#L23-1 assume !!(main_~i~0 < 5); 4951#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 4949#L24-1 havoc main_#t~nondet5; 4947#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4945#L23-4 assume true; 4943#L23-1 assume !(main_~i~0 < 5); 4922#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 4898#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 4899#L28-4 assume true; 4911#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 4904#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 4905#L28-4 assume true; 4932#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 4975#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 4974#L28-4 assume true; 4910#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 4902#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 4903#L28-5 main_~nc_B~0 := 0; 4916#L32-4 assume true; 4917#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 4926#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 4918#L32-4 assume true; 4892#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 4893#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 4934#L32-4 assume true; 4890#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 4891#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 4912#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4906#L41-4 assume true; 4907#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4915#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 4924#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 4921#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 4920#L41-4 [2018-10-27 06:08:41,257 INFO L795 eck$LassoCheckResult]: Loop: 4920#L41-4 assume true; 4913#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4914#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 4923#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 4919#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 4920#L41-4 [2018-10-27 06:08:41,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1170111563, now seen corresponding path program 3 times [2018-10-27 06:08:41,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 7 times [2018-10-27 06:08:41,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:41,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:41,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:41,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1095468177, now seen corresponding path program 3 times [2018-10-27 06:08:41,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:41,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:41,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:41,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,481 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:08:45,054 WARN L179 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 318 DAG size of output: 238 [2018-10-27 06:08:45,213 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-10-27 06:08:45,215 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:45,215 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:45,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:45,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:45,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:45,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:45,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:45,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:45,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration16_Lasso [2018-10-27 06:08:45,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:45,216 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:45,219 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:08:45,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,233 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:08:45,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,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:08:45,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,244 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:08:45,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:08:45,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,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:08:45,679 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2018-10-27 06:08:45,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,781 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:08:45,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,784 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:08:45,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:45,787 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:08:45,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:46,231 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 06:08:46,344 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:46,344 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:46,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:46,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:46,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:46,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:46,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:46,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,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:08:46,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:46,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:46,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:46,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,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:08:46,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:46,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,401 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:46,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,402 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:46,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,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:08:46,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,406 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-10-27 06:08:46,406 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:08:46,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,423 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-10-27 06:08:46,423 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:08:46,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:46,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:46,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:46,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:46,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:46,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:46,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:46,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:46,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:46,556 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:08:46,556 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:46,556 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:46,557 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:46,557 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:46,557 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 4*ULTIMATE.start_main_~#string_B~0.offset + 4*ULTIMATE.start_main_~j~0 + 3*ULTIMATE.start_main_~nc_A~0 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:08:46,784 INFO L297 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2018-10-27 06:08:46,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:46,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:46,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:47,014 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:08:47,014 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-10-27 06:08:47,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 95 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:08:47,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 95 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 130 states and 140 transitions. Complement of second has 13 states. [2018-10-27 06:08:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2018-10-27 06:08:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2018-10-27 06:08:47,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 85 letters. Loop has 5 letters. [2018-10-27 06:08:47,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:47,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 90 letters. Loop has 5 letters. [2018-10-27 06:08:47,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:47,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 85 letters. Loop has 10 letters. [2018-10-27 06:08:47,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:47,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 140 transitions. [2018-10-27 06:08:47,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:47,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 140 transitions. [2018-10-27 06:08:47,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-10-27 06:08:47,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-10-27 06:08:47,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 140 transitions. [2018-10-27 06:08:47,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:47,194 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-10-27 06:08:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 140 transitions. [2018-10-27 06:08:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-10-27 06:08:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-27 06:08:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-10-27 06:08:47,198 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-10-27 06:08:47,198 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-10-27 06:08:47,198 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:08:47,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 135 transitions. [2018-10-27 06:08:47,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:47,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:47,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:47,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:47,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:47,200 INFO L793 eck$LassoCheckResult]: Stem: 5626#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5577#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 5578#L19-4 assume true; 5589#L19-1 assume !!(main_~i~0 < 5); 5576#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 5574#L20-1 havoc main_#t~nondet2; 5575#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5598#L19-4 assume true; 5673#L19-1 assume !!(main_~i~0 < 5); 5669#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 5668#L20-1 havoc main_#t~nondet2; 5666#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5664#L19-4 assume true; 5662#L19-1 assume !!(main_~i~0 < 5); 5660#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 5658#L20-1 havoc main_#t~nondet2; 5656#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5654#L19-4 assume true; 5652#L19-1 assume !!(main_~i~0 < 5); 5650#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 5648#L20-1 havoc main_#t~nondet2; 5646#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5644#L19-4 assume true; 5642#L19-1 assume !!(main_~i~0 < 5); 5640#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 5638#L20-1 havoc main_#t~nondet2; 5636#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5634#L19-4 assume true; 5633#L19-1 assume !(main_~i~0 < 5); 5632#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 5583#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 5584#L23-4 assume true; 5619#L23-1 assume !!(main_~i~0 < 5); 5678#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 5677#L24-1 havoc main_#t~nondet5; 5624#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5625#L23-4 assume true; 5585#L23-1 assume !!(main_~i~0 < 5); 5586#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 5627#L24-1 havoc main_#t~nondet5; 5628#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5667#L23-4 assume true; 5665#L23-1 assume !!(main_~i~0 < 5); 5663#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 5661#L24-1 havoc main_#t~nondet5; 5659#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5657#L23-4 assume true; 5655#L23-1 assume !!(main_~i~0 < 5); 5653#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 5651#L24-1 havoc main_#t~nondet5; 5649#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5647#L23-4 assume true; 5645#L23-1 assume !!(main_~i~0 < 5); 5643#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 5641#L24-1 havoc main_#t~nondet5; 5639#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5637#L23-4 assume true; 5635#L23-1 assume !(main_~i~0 < 5); 5614#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 5587#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 5588#L28-4 assume true; 5601#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 5592#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 5593#L28-4 assume true; 5631#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 5692#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 5679#L28-4 assume true; 5681#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 5590#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 5591#L28-5 main_~nc_B~0 := 0; 5606#L32-4 assume true; 5607#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 5622#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 5623#L32-4 assume true; 5672#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 5676#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 5670#L32-4 assume true; 5671#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 5620#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 5621#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 5691#L41-4 assume true; 5690#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 5689#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 5688#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 5686#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 5684#L41-4 assume true; 5685#L39-1 [2018-10-27 06:08:47,200 INFO L795 eck$LassoCheckResult]: Loop: 5685#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 5698#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 5697#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 5610#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 5611#L41-4 assume true; 5685#L39-1 [2018-10-27 06:08:47,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1913720169, now seen corresponding path program 4 times [2018-10-27 06:08:47,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:47,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:47,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:47,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:47,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:47,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash 114548463, now seen corresponding path program 1 times [2018-10-27 06:08:47,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:47,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:47,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:47,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:47,240 INFO L82 PathProgramCache]: Analyzing trace with hash 400224903, now seen corresponding path program 5 times [2018-10-27 06:08:47,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:47,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:47,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:47,419 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 06:08:50,989 WARN L179 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 318 DAG size of output: 237 [2018-10-27 06:08:51,198 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-10-27 06:08:51,201 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:51,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:51,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:51,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:51,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:51,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:51,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:51,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:51,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration17_Lasso [2018-10-27 06:08:51,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:51,202 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:51,204 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:08:51,210 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:08:51,212 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:08:51,214 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:08:51,216 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:08:51,217 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:08:51,219 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:08:51,221 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:08:51,223 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:08:51,225 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:08:51,226 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:08:51,228 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:08:51,230 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:08:51,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:51,233 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:08:51,235 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:08:51,587 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2018-10-27 06:08:51,662 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:08:51,664 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:08:51,666 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:08:51,668 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:08:51,972 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:51,972 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:51,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:51,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:51,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:51,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:51,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:51,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:51,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:51,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:51,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:51,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:51,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:51,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:51,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:51,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:51,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:51,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:51,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:51,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:51,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:51,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:51,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:51,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:51,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:51,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:51,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:51,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:51,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:08:51,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:51,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:51,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:51,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:51,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:51,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:51,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:51,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:51,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:51,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:51,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:51,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:51,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:51,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:51,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:51,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:51,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:08:51,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:51,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:51,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:51,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:51,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:51,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:51,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:51,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:51,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:51,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:51,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:51,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:51,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,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:08:52,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,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:08:52,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:52,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:52,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:52,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,049 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:52,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,049 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:52,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,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:08:52,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:52,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:52,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:52,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:52,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:52,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:52,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:52,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:52,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:52,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:52,117 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:52,142 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:08:52,142 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:08:52,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:52,143 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:52,143 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:52,143 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_4, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~#string_B~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_4 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-10-27 06:08:53,073 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2018-10-27 06:08:53,075 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:53,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:53,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:53,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:53,140 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:08:53,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:08:53,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 135 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-10-27 06:08:53,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 135 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 168 states and 186 transitions. Complement of second has 7 states. [2018-10-27 06:08:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:08:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-10-27 06:08:53,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 86 letters. Loop has 5 letters. [2018-10-27 06:08:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:53,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 91 letters. Loop has 5 letters. [2018-10-27 06:08:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:53,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 86 letters. Loop has 10 letters. [2018-10-27 06:08:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:53,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 186 transitions. [2018-10-27 06:08:53,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:53,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 159 states and 175 transitions. [2018-10-27 06:08:53,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-10-27 06:08:53,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2018-10-27 06:08:53,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 175 transitions. [2018-10-27 06:08:53,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:53,172 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-10-27 06:08:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 175 transitions. [2018-10-27 06:08:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-27 06:08:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-27 06:08:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2018-10-27 06:08:53,175 INFO L728 BuchiCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-10-27 06:08:53,175 INFO L608 BuchiCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-10-27 06:08:53,175 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-10-27 06:08:53,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 175 transitions. [2018-10-27 06:08:53,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:08:53,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:53,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:53,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:53,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:53,177 INFO L793 eck$LassoCheckResult]: Stem: 6348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 6305#L19-4 assume true; 6312#L19-1 assume !!(main_~i~0 < 5); 6299#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 6297#L20-1 havoc main_#t~nondet2; 6298#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6322#L19-4 assume true; 6393#L19-1 assume !!(main_~i~0 < 5); 6391#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 6389#L20-1 havoc main_#t~nondet2; 6387#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6385#L19-4 assume true; 6383#L19-1 assume !!(main_~i~0 < 5); 6381#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 6379#L20-1 havoc main_#t~nondet2; 6377#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6375#L19-4 assume true; 6373#L19-1 assume !!(main_~i~0 < 5); 6371#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 6369#L20-1 havoc main_#t~nondet2; 6367#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6365#L19-4 assume true; 6363#L19-1 assume !!(main_~i~0 < 5); 6361#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 6359#L20-1 havoc main_#t~nondet2; 6357#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6355#L19-4 assume true; 6354#L19-1 assume !(main_~i~0 < 5); 6353#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 6306#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 6307#L23-4 assume true; 6308#L23-1 assume !!(main_~i~0 < 5); 6309#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 6349#L24-1 havoc main_#t~nondet5; 6346#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6347#L23-4 assume true; 6395#L23-1 assume !!(main_~i~0 < 5); 6394#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 6392#L24-1 havoc main_#t~nondet5; 6390#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6388#L23-4 assume true; 6386#L23-1 assume !!(main_~i~0 < 5); 6384#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 6382#L24-1 havoc main_#t~nondet5; 6380#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6378#L23-4 assume true; 6376#L23-1 assume !!(main_~i~0 < 5); 6374#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 6372#L24-1 havoc main_#t~nondet5; 6370#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6368#L23-4 assume true; 6366#L23-1 assume !!(main_~i~0 < 5); 6364#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 6362#L24-1 havoc main_#t~nondet5; 6360#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6358#L23-4 assume true; 6356#L23-1 assume !(main_~i~0 < 5); 6339#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 6310#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 6311#L28-4 assume true; 6325#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 6315#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 6316#L28-4 assume true; 6352#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 6405#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 6406#L28-4 assume true; 6323#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 6324#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 6350#L28-5 main_~nc_B~0 := 0; 6351#L32-4 assume true; 6403#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 6404#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 6333#L32-4 assume true; 6334#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 6344#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 6345#L32-4 assume true; 6300#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 6301#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 6326#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 6327#L41-4 assume true; 6430#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6429#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 6428#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 6427#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 6317#L41-4 assume true; 6319#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6432#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 6426#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 6412#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 6408#L41-4 assume true; 6328#L39-1 [2018-10-27 06:08:53,177 INFO L795 eck$LassoCheckResult]: Loop: 6328#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6329#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 6340#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 6335#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 6336#L41-4 assume true; 6328#L39-1 [2018-10-27 06:08:53,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash 400224965, now seen corresponding path program 4 times [2018-10-27 06:08:53,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:53,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:53,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:53,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash 114548463, now seen corresponding path program 2 times [2018-10-27 06:08:53,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:53,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:53,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:53,254 INFO L82 PathProgramCache]: Analyzing trace with hash 175507115, now seen corresponding path program 5 times [2018-10-27 06:08:53,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:53,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:53,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:53,539 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 06:08:58,119 WARN L179 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 343 DAG size of output: 258 [2018-10-27 06:08:58,468 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-10-27 06:08:58,470 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:58,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:58,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:58,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:58,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:58,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:58,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:58,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:58,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration18_Lasso [2018-10-27 06:08:58,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:58,471 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:58,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:08:58,479 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:08:58,481 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:08:58,483 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:08:58,485 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:08:58,486 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:08:58,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:58,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:58,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:08:58,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:58,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:08:58,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:08:59,025 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2018-10-27 06:08:59,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:08:59,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:08:59,547 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:08:59,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:08:59,564 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:08:59,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:08:59,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:09:00,069 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-27 06:09:00,174 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:00,174 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:00,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:09:00,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:00,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:00,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:00,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:00,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:00,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:00,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:00,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:00,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:00,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:00,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:00,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:00,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,191 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-10-27 06:09:00,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,194 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-10-27 06:09:00,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:00,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:00,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:00,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:00,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:00,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:00,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:09:00,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:00,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:00,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:00,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:00,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:00,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:00,239 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:00,260 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:09:00,261 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:09:00,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:00,261 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:00,262 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:00,262 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~nc_B~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-10-27 06:09:00,508 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:09:00,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,573 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:09:00,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:09:00,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 175 transitions. cyclomatic complexity: 26 Second operand 4 states. [2018-10-27 06:09:00,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 175 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 187 states and 207 transitions. Complement of second has 7 states. [2018-10-27 06:09:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-10-27 06:09:00,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 91 letters. Loop has 5 letters. [2018-10-27 06:09:00,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:00,587 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:00,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,846 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:09:00,846 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:09:00,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 175 transitions. cyclomatic complexity: 26 Second operand 4 states. [2018-10-27 06:09:00,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 175 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 187 states and 203 transitions. Complement of second has 7 states. [2018-10-27 06:09:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-10-27 06:09:00,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 91 letters. Loop has 5 letters. [2018-10-27 06:09:00,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:00,868 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:00,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:00,977 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:09:00,977 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 3 loop predicates [2018-10-27 06:09:00,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 175 transitions. cyclomatic complexity: 26 Second operand 4 states. [2018-10-27 06:09:01,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 175 transitions. cyclomatic complexity: 26. Second operand 4 states. Result 218 states and 245 transitions. Complement of second has 6 states. [2018-10-27 06:09:01,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-10-27 06:09:01,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 91 letters. Loop has 5 letters. [2018-10-27 06:09:01,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:01,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 96 letters. Loop has 5 letters. [2018-10-27 06:09:01,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:01,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 91 letters. Loop has 10 letters. [2018-10-27 06:09:01,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:01,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 245 transitions. [2018-10-27 06:09:01,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-10-27 06:09:01,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 122 states and 131 transitions. [2018-10-27 06:09:01,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-10-27 06:09:01,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-10-27 06:09:01,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 131 transitions. [2018-10-27 06:09:01,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:01,043 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-10-27 06:09:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 131 transitions. [2018-10-27 06:09:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-10-27 06:09:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 06:09:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-10-27 06:09:01,048 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-10-27 06:09:01,049 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-10-27 06:09:01,049 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-10-27 06:09:01,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 113 transitions. [2018-10-27 06:09:01,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:09:01,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:01,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:01,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:01,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-10-27 06:09:01,050 INFO L793 eck$LassoCheckResult]: Stem: 8094#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8051#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 8052#L19-4 assume true; 8063#L19-1 assume !!(main_~i~0 < 5); 8050#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8048#L20-1 havoc main_#t~nondet2; 8049#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8072#L19-4 assume true; 8143#L19-1 assume !!(main_~i~0 < 5); 8141#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8139#L20-1 havoc main_#t~nondet2; 8137#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8135#L19-4 assume true; 8133#L19-1 assume !!(main_~i~0 < 5); 8131#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8129#L20-1 havoc main_#t~nondet2; 8127#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8125#L19-4 assume true; 8123#L19-1 assume !!(main_~i~0 < 5); 8121#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8119#L20-1 havoc main_#t~nondet2; 8117#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8114#L19-4 assume true; 8111#L19-1 assume !!(main_~i~0 < 5); 8109#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8106#L20-1 havoc main_#t~nondet2; 8102#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8101#L19-4 assume true; 8100#L19-1 assume !(main_~i~0 < 5); 8097#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 8057#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 8058#L23-4 assume true; 8059#L23-1 assume !!(main_~i~0 < 5); 8060#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8095#L24-1 havoc main_#t~nondet5; 8092#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8093#L23-4 assume true; 8146#L23-1 assume !!(main_~i~0 < 5); 8145#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8144#L24-1 havoc main_#t~nondet5; 8142#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8140#L23-4 assume true; 8138#L23-1 assume !!(main_~i~0 < 5); 8136#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8134#L24-1 havoc main_#t~nondet5; 8132#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8130#L23-4 assume true; 8128#L23-1 assume !!(main_~i~0 < 5); 8126#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8124#L24-1 havoc main_#t~nondet5; 8122#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8120#L23-4 assume true; 8118#L23-1 assume !!(main_~i~0 < 5); 8115#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8112#L24-1 havoc main_#t~nondet5; 8110#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8107#L23-4 assume true; 8103#L23-1 assume !(main_~i~0 < 5); 8087#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 8061#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 8062#L28-4 assume true; 8074#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8066#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 8067#L28-4 assume true; 8096#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8116#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 8113#L28-4 assume true; 8105#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8108#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 8104#L28-4 assume true; 8073#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8064#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 8065#L28-5 main_~nc_B~0 := 0; 8080#L32-4 assume true; 8055#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 8056#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 8081#L32-4 assume true; 8082#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 8099#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 8098#L32-4 assume true; 8053#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 8054#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 8075#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 8068#L41-4 assume true; 8069#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 8091#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 8090#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 8085#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 8086#L41-4 assume true; 8076#L39-1 [2018-10-27 06:09:01,050 INFO L795 eck$LassoCheckResult]: Loop: 8076#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 8077#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 8088#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 8089#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 8147#L41-4 assume true; 8148#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 8079#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 8090#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 8085#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 8086#L41-4 assume true; 8076#L39-1 [2018-10-27 06:09:01,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1553540530, now seen corresponding path program 6 times [2018-10-27 06:09:01,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:01,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-27 06:09:01,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:01,316 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:09:01,369 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-27 06:09:01,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:01,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-27 06:09:01,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:01,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-27 06:09:01,499 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:01,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 531143491, now seen corresponding path program 1 times [2018-10-27 06:09:01,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,677 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 06:09:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 06:09:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-10-27 06:09:01,706 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. cyclomatic complexity: 11 Second operand 17 states. [2018-10-27 06:09:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:01,784 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-10-27 06:09:01,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:09:01,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 123 transitions. [2018-10-27 06:09:01,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:09:01,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 113 states and 120 transitions. [2018-10-27 06:09:01,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-10-27 06:09:01,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2018-10-27 06:09:01,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 120 transitions. [2018-10-27 06:09:01,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:01,790 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-10-27 06:09:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 120 transitions. [2018-10-27 06:09:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-10-27 06:09:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-27 06:09:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-10-27 06:09:01,793 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-10-27 06:09:01,793 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-10-27 06:09:01,793 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-10-27 06:09:01,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 116 transitions. [2018-10-27 06:09:01,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-10-27 06:09:01,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:01,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:01,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:01,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-10-27 06:09:01,795 INFO L793 eck$LassoCheckResult]: Stem: 8602#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 8566#L19-4 assume true; 8573#L19-1 assume !!(main_~i~0 < 5); 8560#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8558#L20-1 havoc main_#t~nondet2; 8559#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8582#L19-4 assume true; 8651#L19-1 assume !!(main_~i~0 < 5); 8649#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8647#L20-1 havoc main_#t~nondet2; 8645#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8643#L19-4 assume true; 8641#L19-1 assume !!(main_~i~0 < 5); 8639#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8637#L20-1 havoc main_#t~nondet2; 8635#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8633#L19-4 assume true; 8631#L19-1 assume !!(main_~i~0 < 5); 8629#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8627#L20-1 havoc main_#t~nondet2; 8625#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8623#L19-4 assume true; 8621#L19-1 assume !!(main_~i~0 < 5); 8619#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 8617#L20-1 havoc main_#t~nondet2; 8614#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 8611#L19-4 assume true; 8610#L19-1 assume !(main_~i~0 < 5); 8606#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 8567#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 8568#L23-4 assume true; 8569#L23-1 assume !!(main_~i~0 < 5); 8570#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8603#L24-1 havoc main_#t~nondet5; 8600#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8601#L23-4 assume true; 8653#L23-1 assume !!(main_~i~0 < 5); 8652#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8650#L24-1 havoc main_#t~nondet5; 8648#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8646#L23-4 assume true; 8644#L23-1 assume !!(main_~i~0 < 5); 8642#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8640#L24-1 havoc main_#t~nondet5; 8638#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8636#L23-4 assume true; 8634#L23-1 assume !!(main_~i~0 < 5); 8632#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8630#L24-1 havoc main_#t~nondet5; 8628#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8626#L23-4 assume true; 8624#L23-1 assume !!(main_~i~0 < 5); 8622#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 8620#L24-1 havoc main_#t~nondet5; 8618#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 8615#L23-4 assume true; 8612#L23-1 assume !(main_~i~0 < 5); 8596#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 8571#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 8572#L28-4 assume true; 8584#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8576#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 8577#L28-4 assume true; 8665#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8666#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 8604#L28-4 assume true; 8605#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8616#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 8613#L28-4 assume true; 8583#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 8574#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 8575#L28-5 main_~nc_B~0 := 0; 8590#L32-4 assume true; 8563#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 8564#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 8591#L32-4 assume true; 8592#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 8664#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 8663#L32-4 assume true; 8608#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 8609#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 8607#L32-4 assume true; 8561#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 8562#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 8585#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 8578#L41-4 assume true; 8579#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 8661#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 8659#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 8657#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 8655#L41-4 assume true; 8586#L39-1 [2018-10-27 06:09:01,795 INFO L795 eck$LassoCheckResult]: Loop: 8586#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 8587#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 8597#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 8593#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 8594#L41-4 assume true; 8654#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 8589#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 8659#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 8657#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 8655#L41-4 assume true; 8586#L39-1 [2018-10-27 06:09:01,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,795 INFO L82 PathProgramCache]: Analyzing trace with hash -845017944, now seen corresponding path program 7 times [2018-10-27 06:09:01,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 531143491, now seen corresponding path program 2 times [2018-10-27 06:09:01,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1537457366, now seen corresponding path program 6 times [2018-10-27 06:09:01,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:01,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:01,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:01,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:02,131 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 06:09:06,784 WARN L179 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 342 DAG size of output: 257 [2018-10-27 06:09:07,012 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-10-27 06:09:07,015 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:07,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:07,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:07,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:07,015 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:07,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:07,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:07,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:07,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration20_Lasso [2018-10-27 06:09:07,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:07,015 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:07,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,029 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:09:07,032 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:09:07,034 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:09:07,035 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:09:07,037 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:09:07,039 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:09:07,040 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:09:07,042 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:09:07,044 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:09:07,045 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:09:07,046 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:09:07,048 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:09:07,049 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:09:07,051 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:09:07,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:07,775 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2018-10-27 06:09:07,917 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:09:08,375 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 06:09:08,520 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:08,520 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:08,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:08,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:08,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:08,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:08,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:08,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:08,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,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:09:08,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,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:09:08,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:08,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,574 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-10-27 06:09:08,574 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:08,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,591 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-10-27 06:09:08,591 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:09:08,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,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:09:08,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,641 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:08,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,642 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:08,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:08,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,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:09:08,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:08,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:08,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:08,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:08,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:09:08,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:08,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:08,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:08,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:08,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:08,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:08,677 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:08,713 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:09:08,713 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:09:08,714 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:08,714 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:08,714 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:08,714 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:09,373 INFO L297 tatePredicateManager]: 48 out of 49 supporting invariants were superfluous and have been removed [2018-10-27 06:09:09,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:09,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:09,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:09,581 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2018-10-27 06:09:09,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-10-27 06:09:09,600 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 109 states and 116 transitions. Complement of second has 4 states. [2018-10-27 06:09:09,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:09:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-10-27 06:09:09,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 92 letters. Loop has 10 letters. [2018-10-27 06:09:09,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:09,602 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:09,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:09,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:09,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:09,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2018-10-27 06:09:09,903 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-10-27 06:09:09,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 109 states and 116 transitions. Complement of second has 4 states. [2018-10-27 06:09:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:09:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-10-27 06:09:09,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 92 letters. Loop has 10 letters. [2018-10-27 06:09:09,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:09,930 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:09,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:09,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:09,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:10,022 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2018-10-27 06:09:10,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-10-27 06:09:10,183 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 166 states and 181 transitions. Complement of second has 16 states. [2018-10-27 06:09:10,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2018-10-27 06:09:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:09:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-10-27 06:09:10,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 92 letters. Loop has 10 letters. [2018-10-27 06:09:10,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:10,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 102 letters. Loop has 10 letters. [2018-10-27 06:09:10,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:10,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 92 letters. Loop has 20 letters. [2018-10-27 06:09:10,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:10,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 181 transitions. [2018-10-27 06:09:10,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-10-27 06:09:10,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 149 states and 162 transitions. [2018-10-27 06:09:10,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-10-27 06:09:10,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-10-27 06:09:10,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 162 transitions. [2018-10-27 06:09:10,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:10,189 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 162 transitions. [2018-10-27 06:09:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 162 transitions. [2018-10-27 06:09:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2018-10-27 06:09:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-27 06:09:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-10-27 06:09:10,193 INFO L728 BuchiCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-10-27 06:09:10,193 INFO L608 BuchiCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-10-27 06:09:10,193 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-10-27 06:09:10,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 140 transitions. [2018-10-27 06:09:10,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-10-27 06:09:10,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:10,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:10,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:10,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 1] [2018-10-27 06:09:10,195 INFO L793 eck$LassoCheckResult]: Stem: 10282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 10238#L19-4 assume true; 10332#L19-1 assume !!(main_~i~0 < 5); 10330#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 10233#L20-1 havoc main_#t~nondet2; 10234#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 10249#L19-4 assume true; 10250#L19-1 assume !!(main_~i~0 < 5); 10235#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 10236#L20-1 havoc main_#t~nondet2; 10327#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 10325#L19-4 assume true; 10323#L19-1 assume !!(main_~i~0 < 5); 10321#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 10319#L20-1 havoc main_#t~nondet2; 10317#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 10315#L19-4 assume true; 10313#L19-1 assume !!(main_~i~0 < 5); 10310#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 10308#L20-1 havoc main_#t~nondet2; 10306#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 10303#L19-4 assume true; 10299#L19-1 assume !!(main_~i~0 < 5); 10298#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 10297#L20-1 havoc main_#t~nondet2; 10296#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 10295#L19-4 assume true; 10293#L19-1 assume !(main_~i~0 < 5); 10289#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 10243#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 10244#L23-4 assume true; 10335#L23-1 assume !!(main_~i~0 < 5); 10285#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 10286#L24-1 havoc main_#t~nondet5; 10281#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 10277#L23-4 assume true; 10245#L23-1 assume !!(main_~i~0 < 5); 10246#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 10283#L24-1 havoc main_#t~nondet5; 10284#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 10334#L23-4 assume true; 10333#L23-1 assume !!(main_~i~0 < 5); 10331#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 10329#L24-1 havoc main_#t~nondet5; 10328#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 10326#L23-4 assume true; 10324#L23-1 assume !!(main_~i~0 < 5); 10322#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 10320#L24-1 havoc main_#t~nondet5; 10318#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 10316#L23-4 assume true; 10314#L23-1 assume !!(main_~i~0 < 5); 10312#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 10309#L24-1 havoc main_#t~nondet5; 10307#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 10304#L23-4 assume true; 10300#L23-1 assume !(main_~i~0 < 5); 10273#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 10247#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 10248#L28-4 assume true; 10287#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 10311#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 10288#L28-4 assume true; 10261#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 10253#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 10254#L28-4 assume true; 10302#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 10305#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 10301#L28-4 assume true; 10260#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 10251#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 10252#L28-5 main_~nc_B~0 := 0; 10267#L32-4 assume true; 10268#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 10294#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 10269#L32-4 assume true; 10241#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 10242#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 10278#L32-4 assume true; 10291#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 10292#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 10290#L32-4 assume true; 10239#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 10240#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 10262#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 10263#L41-4 assume true; 10344#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 10279#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 10280#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 10350#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 10347#L41-4 assume true; 10264#L39-1 [2018-10-27 06:09:10,196 INFO L795 eck$LassoCheckResult]: Loop: 10264#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 10265#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 10357#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 10356#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 10355#L41-4 assume true; 10353#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 10352#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 10351#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 10349#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 10348#L41-4 assume true; 10345#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 10346#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 10280#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 10350#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 10347#L41-4 assume true; 10264#L39-1 [2018-10-27 06:09:10,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash -845017944, now seen corresponding path program 8 times [2018-10-27 06:09:10,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:10,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:10,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash -910134417, now seen corresponding path program 3 times [2018-10-27 06:09:10,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:10,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:10,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:10,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1066621976, now seen corresponding path program 7 times [2018-10-27 06:09:10,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:10,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:10,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:11,011 WARN L179 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2018-10-27 06:09:16,416 WARN L179 SmtUtils]: Spent 5.37 s on a formula simplification. DAG size of input: 342 DAG size of output: 260 [2018-10-27 06:09:16,987 WARN L179 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-10-27 06:09:17,005 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:17,005 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:17,005 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:17,005 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:17,005 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:17,005 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:17,005 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:17,005 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:17,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration21_Lasso [2018-10-27 06:09:17,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:17,006 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:17,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:17,020 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:09:17,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,020 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2018-10-27 06:09:18,233 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2018-10-27 06:09:18,233 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:09:18,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,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:09:18,244 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:09:18,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:09:18,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:09:18,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,252 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:09:18,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:18,878 WARN L179 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:09:19,061 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:19,061 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:19,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,087 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:19,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,088 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:19,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,091 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2018-10-27 06:09:19,091 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-10-27 06:09:19,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,136 INFO L402 nArgumentSynthesizer]: We have 168 Motzkin's Theorem applications. [2018-10-27 06:09:19,136 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-10-27 06:09:19,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,313 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:19,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,313 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:19,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,314 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:19,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,343 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:19,366 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:09:19,366 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:09:19,366 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:19,366 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:19,367 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:19,367 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:19,603 INFO L297 tatePredicateManager]: 56 out of 58 supporting invariants were superfluous and have been removed [2018-10-27 06:09:19,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:19,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:19,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:19,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2018-10-27 06:09:19,807 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15 Second operand 12 states. [2018-10-27 06:09:19,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15. Second operand 12 states. Result 151 states and 164 transitions. Complement of second has 8 states. [2018-10-27 06:09:19,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:09:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2018-10-27 06:09:19,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 92 letters. Loop has 15 letters. [2018-10-27 06:09:19,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:19,853 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:19,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:19,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:20,084 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 5 loop predicates [2018-10-27 06:09:20,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15 Second operand 12 states. [2018-10-27 06:09:20,130 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15. Second operand 12 states. Result 151 states and 164 transitions. Complement of second has 8 states. [2018-10-27 06:09:20,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:09:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2018-10-27 06:09:20,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 92 letters. Loop has 15 letters. [2018-10-27 06:09:20,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:20,131 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:20,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:20,274 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2018-10-27 06:09:20,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15 Second operand 12 states. [2018-10-27 06:09:20,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15. Second operand 12 states. Result 217 states and 241 transitions. Complement of second has 14 states. [2018-10-27 06:09:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2018-10-27 06:09:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:09:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-10-27 06:09:20,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 79 transitions. Stem has 92 letters. Loop has 15 letters. [2018-10-27 06:09:20,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:20,376 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:20,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:20,534 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.7 stem predicates 5 loop predicates [2018-10-27 06:09:20,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15 Second operand 12 states. [2018-10-27 06:09:20,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 140 transitions. cyclomatic complexity: 15. Second operand 12 states. Result 220 states and 244 transitions. Complement of second has 15 states. [2018-10-27 06:09:20,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2018-10-27 06:09:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:09:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2018-10-27 06:09:20,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 80 transitions. Stem has 92 letters. Loop has 15 letters. [2018-10-27 06:09:20,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:20,654 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:20,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:20,891 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates [2018-10-27 06:09:20,891 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 129 states and 140 transitions. cyclomatic complexity: 15 Second operand 12 states. [2018-10-27 06:09:21,171 WARN L278 uchiComplementFKVNwa]: big8 [2018-10-27 06:09:21,171 WARN L278 uchiComplementFKVNwa]: big8 [2018-10-27 06:09:21,175 WARN L278 uchiComplementFKVNwa]: big8 [2018-10-27 06:09:21,175 WARN L278 uchiComplementFKVNwa]: big8 [2018-10-27 06:09:21,196 WARN L278 uchiComplementFKVNwa]: big8 [2018-10-27 06:09:21,197 WARN L278 uchiComplementFKVNwa]: big8 [2018-10-27 06:09:21,198 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 129 states and 140 transitions. cyclomatic complexity: 15 Second operand 12 states. Result 1329 states and 1786 transitions. Complement of second has 127 states 21 powerset states106 rank states. The highest rank that occured is 7 [2018-10-27 06:09:21,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 7 stem states 6 non-accepting loop states 2 accepting loop states [2018-10-27 06:09:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:09:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 186 transitions. [2018-10-27 06:09:21,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 186 transitions. Stem has 92 letters. Loop has 15 letters. [2018-10-27 06:09:21,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:21,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 186 transitions. Stem has 107 letters. Loop has 15 letters. [2018-10-27 06:09:21,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:21,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 186 transitions. Stem has 92 letters. Loop has 30 letters. [2018-10-27 06:09:21,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:21,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1329 states and 1786 transitions. [2018-10-27 06:09:21,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 203 [2018-10-27 06:09:21,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1329 states to 1133 states and 1534 transitions. [2018-10-27 06:09:21,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-10-27 06:09:21,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 413 [2018-10-27 06:09:21,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1133 states and 1534 transitions. [2018-10-27 06:09:21,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:21,223 INFO L705 BuchiCegarLoop]: Abstraction has 1133 states and 1534 transitions. [2018-10-27 06:09:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states and 1534 transitions. [2018-10-27 06:09:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 613. [2018-10-27 06:09:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-10-27 06:09:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 867 transitions. [2018-10-27 06:09:21,236 INFO L728 BuchiCegarLoop]: Abstraction has 613 states and 867 transitions. [2018-10-27 06:09:21,236 INFO L608 BuchiCegarLoop]: Abstraction has 613 states and 867 transitions. [2018-10-27 06:09:21,236 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-10-27 06:09:21,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 613 states and 867 transitions. [2018-10-27 06:09:21,239 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 134 [2018-10-27 06:09:21,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:21,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:21,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:21,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 3, 2] [2018-10-27 06:09:21,240 INFO L793 eck$LassoCheckResult]: Stem: 14635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14564#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 14565#L19-4 assume true; 14586#L19-1 assume !!(main_~i~0 < 5); 14782#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 14563#L20-1 havoc main_#t~nondet2; 14780#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 14597#L19-4 assume true; 14777#L19-1 assume !!(main_~i~0 < 5); 14730#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 14772#L20-1 havoc main_#t~nondet2; 14724#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 14771#L19-4 assume true; 14717#L19-1 assume !!(main_~i~0 < 5); 14770#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 14709#L20-1 havoc main_#t~nondet2; 14769#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 14701#L19-4 assume true; 14768#L19-1 assume !!(main_~i~0 < 5); 14693#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 14767#L20-1 havoc main_#t~nondet2; 14685#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 14754#L19-4 assume true; 14677#L19-1 assume !!(main_~i~0 < 5); 14751#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 14669#L20-1 havoc main_#t~nondet2; 14748#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 14661#L19-4 assume true; 14739#L19-1 assume !(main_~i~0 < 5); 14652#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 14766#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 14576#L23-4 assume true; 14764#L23-1 assume !!(main_~i~0 < 5); 14581#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 14762#L24-1 havoc main_#t~nondet5; 14639#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 14760#L23-4 assume true; 14728#L23-1 assume !!(main_~i~0 < 5); 14758#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 14722#L24-1 havoc main_#t~nondet5; 14756#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 14715#L23-4 assume true; 14753#L23-1 assume !!(main_~i~0 < 5); 14707#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 14750#L24-1 havoc main_#t~nondet5; 14699#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 14747#L23-4 assume true; 14691#L23-1 assume !!(main_~i~0 < 5); 14743#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 14683#L24-1 havoc main_#t~nondet5; 14740#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 14675#L23-4 assume true; 14736#L23-1 assume !!(main_~i~0 < 5); 14667#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 14733#L24-1 havoc main_#t~nondet5; 14659#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 14732#L23-4 assume true; 14650#L23-1 assume !(main_~i~0 < 5); 14653#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 14583#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 14584#L28-4 assume true; 14816#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 14857#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 14809#L28-4 assume true; 14856#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 14805#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 14855#L28-4 assume true; 14797#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 14803#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 14799#L28-4 assume true; 14599#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 14600#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 14734#L28-5 main_~nc_B~0 := 0; 14735#L32-4 assume true; 14896#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 14627#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 14628#L32-4 assume true; 14571#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 14572#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 14863#L32-4 assume true; 14864#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 14883#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 14879#L32-4 assume true; 14880#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 14876#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 14877#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 15006#L41-4 assume true; 15007#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 14999#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 14931#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 15098#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 15086#L41-4 assume true; 15083#L39-1 [2018-10-27 06:09:21,240 INFO L795 eck$LassoCheckResult]: Loop: 15083#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 15081#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 15080#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 15079#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 15078#L41-4 assume true; 15076#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 15066#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 15075#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 15074#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 15072#L41-4 assume true; 15073#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 15115#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 15129#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 15108#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 15107#L41-4 assume true; 14967#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 15101#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 14963#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 15105#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 15104#L41-4 assume true; 15102#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 14938#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 14931#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 15098#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 15086#L41-4 assume true; 15083#L39-1 [2018-10-27 06:09:21,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash -845017944, now seen corresponding path program 9 times [2018-10-27 06:09:21,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:21,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash -827956945, now seen corresponding path program 4 times [2018-10-27 06:09:21,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:21,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:21,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1611723160, now seen corresponding path program 8 times [2018-10-27 06:09:21,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:21,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 48 proven. 47 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-27 06:09:21,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:21,762 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_484159c4-eeec-4a87-8983-f0c34fe8e600/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:21,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:21,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:21,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:21,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-10-27 06:09:21,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:21,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-10-27 06:09:22,110 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 116 [2018-10-27 06:09:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 06:09:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-10-27 06:09:22,207 INFO L87 Difference]: Start difference. First operand 613 states and 867 transitions. cyclomatic complexity: 271 Second operand 16 states. [2018-10-27 06:09:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:22,326 INFO L93 Difference]: Finished difference Result 690 states and 961 transitions. [2018-10-27 06:09:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:09:22,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 961 transitions. [2018-10-27 06:09:22,332 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-10-27 06:09:22,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 595 states and 829 transitions. [2018-10-27 06:09:22,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2018-10-27 06:09:22,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2018-10-27 06:09:22,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 829 transitions. [2018-10-27 06:09:22,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:22,337 INFO L705 BuchiCegarLoop]: Abstraction has 595 states and 829 transitions. [2018-10-27 06:09:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 829 transitions. [2018-10-27 06:09:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 522. [2018-10-27 06:09:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-27 06:09:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 747 transitions. [2018-10-27 06:09:22,354 INFO L728 BuchiCegarLoop]: Abstraction has 522 states and 747 transitions. [2018-10-27 06:09:22,354 INFO L608 BuchiCegarLoop]: Abstraction has 522 states and 747 transitions. [2018-10-27 06:09:22,354 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-10-27 06:09:22,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 747 transitions. [2018-10-27 06:09:22,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 71 [2018-10-27 06:09:22,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:22,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:22,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,363 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:22,363 INFO L793 eck$LassoCheckResult]: Stem: 16316#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 16245#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;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_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 16247#L19-4 assume true; 16268#L19-1 assume !!(main_~i~0 < 5); 16241#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 16237#L20-1 havoc main_#t~nondet2; 16238#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 16278#L19-4 assume true; 16416#L19-1 assume !!(main_~i~0 < 5); 16415#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 16412#L20-1 havoc main_#t~nondet2; 16409#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 16404#L19-4 assume true; 16400#L19-1 assume !!(main_~i~0 < 5); 16395#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 16391#L20-1 havoc main_#t~nondet2; 16386#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 16382#L19-4 assume true; 16377#L19-1 assume !!(main_~i~0 < 5); 16373#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 16368#L20-1 havoc main_#t~nondet2; 16364#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 16359#L19-4 assume true; 16355#L19-1 assume !!(main_~i~0 < 5); 16350#L20 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L20 16346#L20-1 havoc main_#t~nondet2; 16341#L19-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 16337#L19-4 assume true; 16332#L19-1 assume !(main_~i~0 < 5); 16328#L19-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L19-5 16254#L21 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 16256#L23-4 assume true; 16307#L23-1 assume !!(main_~i~0 < 5); 16323#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 16318#L24-1 havoc main_#t~nondet5; 16314#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 16315#L23-4 assume true; 16259#L23-1 assume !!(main_~i~0 < 5); 16260#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 16407#L24-1 havoc main_#t~nondet5; 16402#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 16398#L23-4 assume true; 16393#L23-1 assume !!(main_~i~0 < 5); 16389#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 16384#L24-1 havoc main_#t~nondet5; 16380#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 16375#L23-4 assume true; 16371#L23-1 assume !!(main_~i~0 < 5); 16366#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 16362#L24-1 havoc main_#t~nondet5; 16357#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 16353#L23-4 assume true; 16348#L23-1 assume !!(main_~i~0 < 5); 16344#L24 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L24 16339#L24-1 havoc main_#t~nondet5; 16335#L23-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 16330#L23-4 assume true; 16329#L23-1 assume !(main_~i~0 < 5); 16302#L23-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L23-5 16303#L25 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 16497#L28-4 assume true; 16495#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 16494#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 16492#L28-4 assume true; 16491#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 16489#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 16486#L28-4 assume true; 16488#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 16542#L28-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 16474#L28-4 assume true; 16475#L28-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L28-1 16522#L28-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 16523#L28-5 main_~nc_B~0 := 0; 16516#L32-4 assume true; 16518#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 16511#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 16513#L32-4 assume true; 16507#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 16508#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 16502#L32-4 assume true; 16503#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 16480#L32-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 16482#L32-4 assume true; 16454#L32-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L32-1 16455#L32-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 16533#L32-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 16545#L41-4 assume true; 16659#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 16658#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 16656#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 16643#L41-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 16644#L41-4 assume true; 16274#L39-1 [2018-10-27 06:09:22,363 INFO L795 eck$LassoCheckResult]: Loop: 16274#L39-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 16640#L41 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L41 16304#L41-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L41-1 16305#L41-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 16273#L41-4 assume true; 16274#L39-1 [2018-10-27 06:09:22,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -845017944, now seen corresponding path program 10 times [2018-10-27 06:09:22,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,421 INFO L82 PathProgramCache]: Analyzing trace with hash 114548525, now seen corresponding path program 8 times [2018-10-27 06:09:22,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash 93496038, now seen corresponding path program 9 times [2018-10-27 06:09:22,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,844 WARN L179 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:09:23,164 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-27 06:09:28,322 WARN L179 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 342 DAG size of output: 260 [2018-10-27 06:09:28,730 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-10-27 06:09:28,732 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:28,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:28,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:28,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:28,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:28,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:28,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:28,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:28,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration23_Lasso [2018-10-27 06:09:28,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:28,733 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:28,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:09:28,747 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:09:28,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:09:28,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:09:28,754 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:09:28,755 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:09:28,757 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:09:28,760 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:09:28,761 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:09:28,763 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:09:29,316 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 99 [2018-10-27 06:09:29,425 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:09:29,427 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:09:29,429 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:09:29,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,440 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:09:29,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:29,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:09:29,447 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:09:29,449 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:09:29,846 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:29,846 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:29,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,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:09:29,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,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:09:29,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,863 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:29,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,863 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:29,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,865 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-10-27 06:09:29,866 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:29,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,869 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-10-27 06:09:29,869 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:09:29,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,896 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:29,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,896 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:29,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:29,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:29,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:29,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,907 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:29,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,907 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:29,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:29,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:09:29,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:29,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:29,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:29,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:29,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:29,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:29,943 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:30,026 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-10-27 06:09:30,026 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:09:30,027 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:30,028 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:30,028 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:30,028 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_10, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_10 + 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-10-27 06:09:30,447 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-10-27 06:09:30,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:30,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:30,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:30,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:30,564 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:09:30,564 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-10-27 06:09:30,564 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 522 states and 747 transitions. cyclomatic complexity: 244 Second operand 7 states. [2018-10-27 06:09:30,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 522 states and 747 transitions. cyclomatic complexity: 244. Second operand 7 states. Result 803 states and 1159 transitions. Complement of second has 9 states. [2018-10-27 06:09:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:09:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-10-27 06:09:30,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 92 letters. Loop has 5 letters. [2018-10-27 06:09:30,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:30,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 97 letters. Loop has 5 letters. [2018-10-27 06:09:30,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:30,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 92 letters. Loop has 10 letters. [2018-10-27 06:09:30,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:30,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 803 states and 1159 transitions. [2018-10-27 06:09:30,645 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:30,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 803 states to 0 states and 0 transitions. [2018-10-27 06:09:30,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:09:30,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:09:30,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:09:30,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:30,646 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:30,646 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:30,646 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:30,646 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-10-27 06:09:30,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:30,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:30,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:09:30,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:30 BoogieIcfgContainer [2018-10-27 06:09:30,658 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:30,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:30,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:30,658 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:30,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:19" (3/4) ... [2018-10-27 06:09:30,662 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:09:30,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:30,668 INFO L168 Benchmark]: Toolchain (without parser) took 71672.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.3 MB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -355.9 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:30,669 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:30,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 944.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:30,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.07 ms. Allocated memory is still 1.0 GB. Free memory was 944.8 MB in the beginning and 942.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:30,670 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 ms. Allocated memory is still 1.0 GB. Free memory was 942.1 MB in the beginning and 939.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:30,670 INFO L168 Benchmark]: RCFGBuilder took 583.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:30,679 INFO L168 Benchmark]: BuchiAutomizer took 70760.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.5 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:30,680 INFO L168 Benchmark]: Witness Printer took 4.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:30,683 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 225.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 944.8 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.07 ms. Allocated memory is still 1.0 GB. Free memory was 944.8 MB in the beginning and 942.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.80 ms. Allocated memory is still 1.0 GB. Free memory was 942.1 MB in the beginning and 939.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 583.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 70760.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.5 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 23 terminating modules (13 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_B] + -1 * string_B + -1 * nc_B and consists of 4 locations. One deterministic module has affine ranking function nc_A + -1 * i and consists of 5 locations. One deterministic module has affine ranking function 4 * string_B + 4 * j + 3 * nc_A + -4 * i and consists of 9 locations. One deterministic module has affine ranking function -1 * string_B + unknown-#length-unknown[string_B] + -1 * j and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + j + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function nc_B + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function nc_A + -1 * i and consists of 8 locations. One nondeterministic module has affine ranking function 2 * j + -1 * i and consists of 15 locations. 13 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 70.7s and 24 iterations. TraceHistogramMax:6. Analysis of lassos took 64.5s. Construction of modules took 1.6s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 7. Minimization of det autom 2. Minimization of nondet autom 21. Automata minimization 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 812 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 613 states and ocurred in iteration 21. Nontrivial modules had stage [7, 0, 2, 0, 1]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/20 HoareTripleCheckerStatistics: 915 SDtfs, 1471 SDslu, 2134 SDs, 0 SdLazy, 1807 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU9 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital346 mio100 ax100 hnf99 lsp96 ukn57 mio100 lsp50 div100 bol100 ite100 ukn100 eq180 hnf83 smp95 dnf190 smp96 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 215ms VariablesStem: 10 VariablesLoop: 11 DisjunctsStem: 16 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 168 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...