./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-635dfa2 [2018-12-02 03:50:28,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:50:28,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:50:28,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:50:28,147 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:50:28,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:50:28,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:50:28,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:50:28,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:50:28,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:50:28,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:50:28,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:50:28,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:50:28,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:50:28,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:50:28,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:50:28,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:50:28,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:50:28,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:50:28,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:50:28,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:50:28,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:50:28,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:50:28,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:50:28,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:50:28,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:50:28,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:50:28,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:50:28,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:50:28,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:50:28,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:50:28,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:50:28,160 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:50:28,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:50:28,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:50:28,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:50:28,161 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 03:50:28,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:50:28,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:50:28,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:50:28,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:50:28,170 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 03:50:28,170 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 03:50:28,170 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 03:50:28,170 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 03:50:28,170 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 03:50:28,170 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 03:50:28,170 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 03:50:28,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:50:28,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:50:28,172 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 03:50:28,172 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:50:28,172 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 03:50:28,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:50:28,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:50:28,172 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 03:50:28,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:50:28,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 03:50:28,172 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 03:50:28,173 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 03:50:28,173 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_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:28,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:50:28,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:50:28,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:50:28,199 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:50:28,199 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:50:28,200 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-12-02 03:50:28,234 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/data/e325b9b82/52beaa59f906408dbafa72b3f2e6cb0a/FLAG843f93086 [2018-12-02 03:50:28,666 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:50:28,666 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-12-02 03:50:28,670 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/data/e325b9b82/52beaa59f906408dbafa72b3f2e6cb0a/FLAG843f93086 [2018-12-02 03:50:29,066 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/data/e325b9b82/52beaa59f906408dbafa72b3f2e6cb0a [2018-12-02 03:50:29,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:50:29,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:50:29,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:50:29,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:50:29,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:50:29,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537737cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29, skipping insertion in model container [2018-12-02 03:50:29,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:50:29,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:50:29,184 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:50:29,186 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:50:29,200 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:50:29,211 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:50:29,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29 WrapperNode [2018-12-02 03:50:29,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:50:29,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:50:29,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:50:29,212 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:50:29,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:50:29,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:50:29,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:50:29,234 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:50:29,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... [2018-12-02 03:50:29,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:50:29,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:50:29,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:50:29,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:50:29,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:29,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:50:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:50:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:50:29,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:50:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 03:50:29,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:50:29,464 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:50:29,465 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-02 03:50:29,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:50:29 BoogieIcfgContainer [2018-12-02 03:50:29,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:50:29,466 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 03:50:29,466 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 03:50:29,469 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 03:50:29,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:50:29,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:50:29" (1/3) ... [2018-12-02 03:50:29,471 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64423c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:50:29, skipping insertion in model container [2018-12-02 03:50:29,471 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:50:29,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:50:29" (2/3) ... [2018-12-02 03:50:29,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64423c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:50:29, skipping insertion in model container [2018-12-02 03:50:29,472 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:50:29,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:50:29" (3/3) ... [2018-12-02 03:50:29,473 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-12-02 03:50:29,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:50:29,517 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 03:50:29,517 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 03:50:29,517 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 03:50:29,517 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:50:29,517 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:50:29,517 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 03:50:29,517 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:50:29,517 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 03:50:29,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 03:50:29,541 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 03:50:29,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:29,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:29,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 03:50:29,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:29,547 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 03:50:29,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 03:50:29,549 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 03:50:29,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:29,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:29,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 03:50:29,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:29,556 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4#L-1true 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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-3true [2018-12-02 03:50:29,556 INFO L796 eck$LassoCheckResult]: Loop: 14#L19-3true assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 17#L19-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 14#L19-3true [2018-12-02 03:50:29,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 03:50:29,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:29,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:29,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-02 03:50:29,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:29,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:29,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:29,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-02 03:50:29,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:29,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:29,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:29,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:29,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:29,757 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:29,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:29,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:29,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:29,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:29,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:29,758 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:29,758 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:29,758 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-02 03:50:29,758 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:29,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:29,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,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-12-02 03:50:29,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,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-12-02 03:50:29,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-12-02 03:50:29,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-12-02 03:50:29,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-12-02 03:50:29,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:29,978 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:29,981 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:29,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:29,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:29,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:29,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:29,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:29,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:29,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:29,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:29,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:29,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:29,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:29,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:29,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:29,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:29,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:29,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:29,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:29,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:29,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:29,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:29,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:29,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:29,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:29,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:29,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:29,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:29,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:29,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-12-02 03:50:29,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:29,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:29,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:29,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:29,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:29,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:29,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:29,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:29,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:29,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:29,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:29,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:29,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:29,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:29,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:29,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:29,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:29,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-12-02 03:50:29,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:29,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:29,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:29,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:29,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:29,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:29,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:29,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:29,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:29,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:29,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:29,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:29,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:29,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:29,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,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-12-02 03:50:30,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:30,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:30,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,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-12-02 03:50:30,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,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-12-02 03:50:30,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:30,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:30,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:30,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:30,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:30,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,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-12-02 03:50:30,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:30,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:30,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:30,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:30,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:30,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:30,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:30,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:30,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:30,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:30,058 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:30,082 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 03:50:30,082 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 03:50:30,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:30,084 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:30,085 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:30,085 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1, ULTIMATE.start_main_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 03:50:30,090 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 03:50:30,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:50:30,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:30,148 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-12-02 03:50:30,149 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-02 03:50:30,183 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 50 states and 80 transitions. Complement of second has 8 states. [2018-12-02 03:50:30,184 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-12-02 03:50:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-02 03:50:30,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-02 03:50:30,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:30,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 03:50:30,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:30,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 03:50:30,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:30,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2018-12-02 03:50:30,189 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2018-12-02 03:50:30,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 03:50:30,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 03:50:30,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-12-02 03:50:30,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:50:30,193 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-02 03:50:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-12-02 03:50:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 03:50:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 03:50:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-12-02 03:50:30,209 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-02 03:50:30,209 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-02 03:50:30,209 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 03:50:30,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-12-02 03:50:30,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:30,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:30,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 03:50:30,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:30,211 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 129#L19-3 assume !(main_~i~0 < 5); 127#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 128#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 142#L23-3 [2018-12-02 03:50:30,211 INFO L796 eck$LassoCheckResult]: Loop: 142#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 143#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 142#L23-3 [2018-12-02 03:50:30,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-12-02 03:50:30,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:30,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:50:30,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:50:30,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:50:30,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-12-02 03:50:30,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:50:30,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:50:30,273 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-02 03:50:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:30,297 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-12-02 03:50:30,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:50:30,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-12-02 03:50:30,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2018-12-02 03:50:30,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-02 03:50:30,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-02 03:50:30,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-12-02 03:50:30,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:50:30,300 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-02 03:50:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-12-02 03:50:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-12-02 03:50:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 03:50:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-02 03:50:30,301 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 03:50:30,301 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 03:50:30,302 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 03:50:30,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-02 03:50:30,302 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:30,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:30,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:30,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:30,303 INFO L794 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 178#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 179#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 180#L19-3 assume !(main_~i~0 < 5); 176#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 177#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 191#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 192#L23-2 [2018-12-02 03:50:30,303 INFO L796 eck$LassoCheckResult]: Loop: 192#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 194#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 192#L23-2 [2018-12-02 03:50:30,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2018-12-02 03:50:30,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:30,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:30,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:30,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:50:30,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:30,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:30,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 03:50:30,351 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:50:30,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2018-12-02 03:50:30,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:50:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:50:30,378 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-02 03:50:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:30,409 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-02 03:50:30,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:50:30,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-12-02 03:50:30,410 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-12-02 03:50:30,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-02 03:50:30,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-02 03:50:30,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-12-02 03:50:30,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:50:30,411 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-02 03:50:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-12-02 03:50:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 03:50:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 03:50:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-02 03:50:30,413 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-02 03:50:30,413 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-02 03:50:30,413 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 03:50:30,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-12-02 03:50:30,413 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:30,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:30,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:30,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:30,414 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 273#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 257#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 258#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 259#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 260#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 277#L19-3 assume !(main_~i~0 < 5); 255#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 256#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 274#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 275#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 271#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 272#L23-2 [2018-12-02 03:50:30,414 INFO L796 eck$LassoCheckResult]: Loop: 272#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 278#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 272#L23-2 [2018-12-02 03:50:30,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2018-12-02 03:50:30,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 03:50:30,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:30,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:30,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 03:50:30,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:30,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 03:50:30,476 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:50:30,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2018-12-02 03:50:30,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:50:30,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:50:30,504 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-12-02 03:50:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:30,550 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-02 03:50:30,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:50:30,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-02 03:50:30,551 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-12-02 03:50:30,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-02 03:50:30,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-02 03:50:30,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-12-02 03:50:30,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:50:30,552 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-12-02 03:50:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-12-02 03:50:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-02 03:50:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 03:50:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-02 03:50:30,554 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-02 03:50:30,554 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-02 03:50:30,554 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 03:50:30,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-12-02 03:50:30,555 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:30,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:30,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-12-02 03:50:30,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:30,556 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 359#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 360#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 384#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 366#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 361#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 362#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 381#L19-3 assume !(main_~i~0 < 5); 357#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 358#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 377#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 378#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 379#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 383#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 374#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 375#L23-2 [2018-12-02 03:50:30,556 INFO L796 eck$LassoCheckResult]: Loop: 375#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 382#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 375#L23-2 [2018-12-02 03:50:30,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2018-12-02 03:50:30,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 03:50:30,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:30,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 03:50:30,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 03:50:30,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:50:30,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 03:50:30,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:30,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 03:50:30,631 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:50:30,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2018-12-02 03:50:30,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:50:30,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:50:30,651 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-12-02 03:50:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:30,693 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-12-02 03:50:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:50:30,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2018-12-02 03:50:30,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2018-12-02 03:50:30,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-02 03:50:30,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-02 03:50:30,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-12-02 03:50:30,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:50:30,695 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-02 03:50:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-12-02 03:50:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-12-02 03:50:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 03:50:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-02 03:50:30,696 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 03:50:30,696 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 03:50:30,696 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 03:50:30,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-12-02 03:50:30,697 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:30,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:30,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-12-02 03:50:30,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:30,697 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 501#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 484#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 485#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 486#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 487#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 491#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 510#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 509#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 506#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 505#L19-3 assume !(main_~i~0 < 5); 482#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 483#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 502#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 503#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 499#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 500#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 513#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 512#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 511#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 508#L23-2 [2018-12-02 03:50:30,697 INFO L796 eck$LassoCheckResult]: Loop: 508#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 507#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 508#L23-2 [2018-12-02 03:50:30,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2018-12-02 03:50:30,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 03:50:30,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:30,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:30,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:50:30,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 03:50:30,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:50:30,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 03:50:30,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:30,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 03:50:30,808 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:50:30,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2018-12-02 03:50:30,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:50:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:50:30,837 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-02 03:50:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:30,885 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-12-02 03:50:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:50:30,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-12-02 03:50:30,886 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-12-02 03:50:30,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-02 03:50:30,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-02 03:50:30,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-12-02 03:50:30,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:50:30,887 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-02 03:50:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-12-02 03:50:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-12-02 03:50:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 03:50:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-02 03:50:30,889 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 03:50:30,890 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 03:50:30,890 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 03:50:30,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-12-02 03:50:30,890 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 03:50:30,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:30,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:30,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-12-02 03:50:30,891 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:30,891 INFO L794 eck$LassoCheckResult]: Stem: 648#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 646#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 630#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 631#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 632#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 633#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 655#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 654#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 653#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 652#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 651#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 650#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 649#L19-3 assume !(main_~i~0 < 5); 628#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 629#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 644#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 645#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 647#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 663#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 662#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 661#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 660#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 659#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 658#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 657#L23-2 [2018-12-02 03:50:30,891 INFO L796 eck$LassoCheckResult]: Loop: 657#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 656#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 657#L23-2 [2018-12-02 03:50:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2018-12-02 03:50:30,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2018-12-02 03:50:30,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:30,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2018-12-02 03:50:30,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:30,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:30,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:30,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 03:50:31,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:50:31,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:50:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:50:31,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:50:31,070 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-02 03:50:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:31,110 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-02 03:50:31,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:50:31,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-12-02 03:50:31,112 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 03:50:31,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 03:50:31,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-02 03:50:31,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 03:50:31,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-12-02 03:50:31,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:50:31,113 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 03:50:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-12-02 03:50:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-02 03:50:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 03:50:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-02 03:50:31,115 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-02 03:50:31,115 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-02 03:50:31,115 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 03:50:31,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-12-02 03:50:31,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 03:50:31,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:31,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:31,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:31,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:31,117 INFO L794 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 733#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 717#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 718#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 719#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 720#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 750#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 749#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 748#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 747#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 746#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 737#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 736#L19-3 assume !(main_~i~0 < 5); 715#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 716#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 731#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 732#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 734#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 745#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 744#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 743#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 742#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 741#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 740#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 739#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 738#L23-3 assume !(main_~i~0 < 5); 729#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 730#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 723#L28-3 [2018-12-02 03:50:31,117 INFO L796 eck$LassoCheckResult]: Loop: 723#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 721#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 723#L28-3 [2018-12-02 03:50:31,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2018-12-02 03:50:31,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:31,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:31,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:31,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2018-12-02 03:50:31,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:31,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:31,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:31,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2018-12-02 03:50:31,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:31,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:31,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:31,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:33,578 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-12-02 03:50:33,669 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:33,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:33,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:33,669 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:33,670 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:33,670 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:33,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:33,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:33,670 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration8_Lasso [2018-12-02 03:50:33,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:33,670 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:33,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:33,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-12-02 03:50:33,862 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:33,862 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:33,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-12-02 03:50:33,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,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-12-02 03:50:33,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,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-12-02 03:50:33,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,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-12-02 03:50:33,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,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-12-02 03:50:33,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,894 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:50:33,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:50:33,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,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-12-02 03:50:33,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,898 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:50:33,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,899 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:50:33,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,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-12-02 03:50:33,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:33,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:33,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:33,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,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-12-02 03:50:33,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:33,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:33,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:33,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:33,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:33,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:33,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:33,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:33,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:33,917 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 03:50:33,917 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 03:50:33,918 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:33,918 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:33,918 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:33,918 INFO L520 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-12-02 03:50:33,929 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 03:50:33,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:50:33,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:33,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:33,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:33,971 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-12-02 03:50:33,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 03:50:33,982 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-12-02 03:50:33,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:50:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-02 03:50:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2018-12-02 03:50:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:33,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2018-12-02 03:50:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:33,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-02 03:50:33,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:33,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-12-02 03:50:33,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 03:50:33,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-12-02 03:50:33,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-02 03:50:33,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 03:50:33,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-02 03:50:33,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:33,986 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 03:50:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-02 03:50:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-02 03:50:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 03:50:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-02 03:50:33,988 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 03:50:33,988 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 03:50:33,988 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 03:50:33,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-12-02 03:50:33,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 03:50:33,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:33,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:33,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:33,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:33,989 INFO L794 eck$LassoCheckResult]: Stem: 943#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 940#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 923#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 924#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 925#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 926#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 951#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 950#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 949#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 948#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 947#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 946#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 945#L19-3 assume !(main_~i~0 < 5); 921#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 922#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 941#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 942#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 938#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 939#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 958#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 957#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 956#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 955#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 954#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 953#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 952#L23-3 assume !(main_~i~0 < 5); 936#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 937#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 944#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 927#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 928#L28-4 main_~nc_B~0 := 0; 934#L32-3 [2018-12-02 03:50:33,989 INFO L796 eck$LassoCheckResult]: Loop: 934#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 935#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 934#L32-3 [2018-12-02 03:50:33,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:33,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2018-12-02 03:50:33,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:33,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:33,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:33,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:33,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:34,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2018-12-02 03:50:34,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:34,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:34,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:34,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2018-12-02 03:50:34,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:34,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:34,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:34,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:34,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:36,409 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 224 DAG size of output: 171 [2018-12-02 03:50:36,513 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:36,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:36,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:36,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:36,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:36,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:36,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:36,513 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:36,513 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-02 03:50:36,513 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:36,513 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:36,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:36,687 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:36,687 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:36,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:36,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:36,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:36,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:36,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:36,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:36,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:36,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:36,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:36,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:36,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:36,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:36,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:36,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:36,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:36,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:36,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:36,712 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:36,717 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 03:50:36,718 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 03:50:36,718 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:36,718 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:36,718 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:36,719 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3) = -1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 Supporting invariants [] [2018-12-02 03:50:36,728 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-02 03:50:36,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:50:36,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:36,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:36,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:36,778 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-12-02 03:50:36,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 03:50:36,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 51 transitions. Complement of second has 4 states. [2018-12-02 03:50:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:50:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-02 03:50:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2018-12-02 03:50:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2018-12-02 03:50:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2018-12-02 03:50:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:36,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-12-02 03:50:36,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:36,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2018-12-02 03:50:36,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-02 03:50:36,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 03:50:36,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-12-02 03:50:36,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:36,795 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-02 03:50:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-12-02 03:50:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 03:50:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 03:50:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-02 03:50:36,797 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-02 03:50:36,798 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-02 03:50:36,798 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 03:50:36,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-12-02 03:50:36,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:36,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:36,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:36,799 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:36,799 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:36,799 INFO L794 eck$LassoCheckResult]: Stem: 1161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1158#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 1139#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1140#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1141#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1142#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1169#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1168#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1167#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1166#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1165#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1164#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1163#L19-3 assume !(main_~i~0 < 5); 1137#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1138#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1159#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1160#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1156#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1157#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1176#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1175#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1174#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1173#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1172#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1171#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1170#L23-3 assume !(main_~i~0 < 5); 1154#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1155#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1162#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1143#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1144#L28-4 main_~nc_B~0 := 0; 1150#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1152#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1147#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1148#L41-2 [2018-12-02 03:50:36,800 INFO L796 eck$LassoCheckResult]: Loop: 1148#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1149#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1148#L41-2 [2018-12-02 03:50:36,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2018-12-02 03:50:36,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:36,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:36,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:36,824 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2018-12-02 03:50:36,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:36,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:36,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:36,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:36,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2018-12-02 03:50:36,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:36,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 03:50:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:50:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:50:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:50:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:50:36,922 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-02 03:50:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:36,930 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-02 03:50:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:50:36,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-12-02 03:50:36,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:36,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2018-12-02 03:50:36,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-02 03:50:36,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 03:50:36,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-12-02 03:50:36,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:36,932 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-02 03:50:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-12-02 03:50:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-02 03:50:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 03:50:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 03:50:36,933 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 03:50:36,933 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 03:50:36,933 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 03:50:36,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-12-02 03:50:36,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:36,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:36,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:36,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:36,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:36,934 INFO L794 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1257#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 1237#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1238#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1239#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1240#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1245#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1266#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1265#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1264#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1263#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1262#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1261#L19-3 assume !(main_~i~0 < 5); 1235#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1236#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1255#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1256#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1258#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1274#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1273#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1272#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1271#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1270#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1269#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1268#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1267#L23-3 assume !(main_~i~0 < 5); 1253#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1254#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1260#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1243#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1244#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1241#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1242#L28-4 main_~nc_B~0 := 0; 1249#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1250#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1246#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1247#L41-2 [2018-12-02 03:50:36,934 INFO L796 eck$LassoCheckResult]: Loop: 1247#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1248#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1247#L41-2 [2018-12-02 03:50:36,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2018-12-02 03:50:36,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:36,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 03:50:36,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:36,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:36,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:37,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 03:50:37,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:50:37,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-12-02 03:50:37,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:50:37,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2018-12-02 03:50:37,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:37,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:37,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:37,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:50:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:50:37,085 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-02 03:50:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:37,122 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-02 03:50:37,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:50:37,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-12-02 03:50:37,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:37,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2018-12-02 03:50:37,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-02 03:50:37,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 03:50:37,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-12-02 03:50:37,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:37,123 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-02 03:50:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-12-02 03:50:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-02 03:50:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 03:50:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-02 03:50:37,125 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-02 03:50:37,125 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-02 03:50:37,125 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 03:50:37,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-12-02 03:50:37,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:37,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:37,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:37,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:37,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:37,126 INFO L794 eck$LassoCheckResult]: Stem: 1461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1459#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 1440#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1441#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1442#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1443#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1469#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1468#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1467#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1466#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1465#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1464#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1463#L19-3 assume !(main_~i~0 < 5); 1438#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1439#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1457#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1458#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1460#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1477#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1476#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1475#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1474#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1473#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1472#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1471#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1470#L23-3 assume !(main_~i~0 < 5); 1455#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1456#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1462#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1446#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1447#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1444#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1445#L28-4 main_~nc_B~0 := 0; 1451#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1452#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1453#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1454#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1448#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1449#L41-2 [2018-12-02 03:50:37,126 INFO L796 eck$LassoCheckResult]: Loop: 1449#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1450#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1449#L41-2 [2018-12-02 03:50:37,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2018-12-02 03:50:37,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:37,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:37,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:37,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2018-12-02 03:50:37,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:37,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:37,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:37,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:37,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2018-12-02 03:50:37,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:37,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:40,068 WARN L180 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 261 DAG size of output: 199 [2018-12-02 03:50:40,204 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-02 03:50:40,206 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:40,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:40,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:40,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:40,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:40,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:40,206 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:40,206 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:40,206 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-02 03:50:40,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:40,206 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:40,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,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-12-02 03:50:40,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,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-12-02 03:50:40,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-12-02 03:50:40,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,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-12-02 03:50:40,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,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-12-02 03:50:40,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,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-12-02 03:50:40,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:40,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-12-02 03:50:40,627 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:40,627 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:40,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:40,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:40,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:40,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:40,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:40,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:40,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:40,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:40,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:40,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,631 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:50:40,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,631 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:50:40,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,638 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-02 03:50:40,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,639 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 03:50:40,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,649 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:50:40,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,650 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:50:40,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:40,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:40,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:40,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,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-12-02 03:50:40,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:40,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:40,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:40,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:40,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:40,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:40,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:40,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:40,681 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:40,706 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2018-12-02 03:50:40,706 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2018-12-02 03:50:40,706 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:40,707 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:40,707 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:40,707 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_B~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2018-12-02 03:50:40,747 INFO L297 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2018-12-02 03:50:40,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:40,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:40,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:40,858 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2018-12-02 03:50:40,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-02 03:50:40,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 61 states and 71 transitions. Complement of second has 11 states. [2018-12-02 03:50:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-02 03:50:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 03:50:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-12-02 03:50:40,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 38 letters. Loop has 2 letters. [2018-12-02 03:50:40,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:40,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-02 03:50:40,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:40,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 38 letters. Loop has 4 letters. [2018-12-02 03:50:40,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:40,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 71 transitions. [2018-12-02 03:50:40,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:40,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 71 transitions. [2018-12-02 03:50:40,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-02 03:50:40,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-12-02 03:50:40,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 71 transitions. [2018-12-02 03:50:40,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:40,928 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-12-02 03:50:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 71 transitions. [2018-12-02 03:50:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-12-02 03:50:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 03:50:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-12-02 03:50:40,930 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-02 03:50:40,930 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-02 03:50:40,930 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 03:50:40,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 61 transitions. [2018-12-02 03:50:40,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:40,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:40,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:40,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:40,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:40,931 INFO L794 eck$LassoCheckResult]: Stem: 1787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1785#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 1763#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1764#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1765#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1766#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1803#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1801#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1799#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1797#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1795#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1791#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1790#L19-3 assume !(main_~i~0 < 5); 1761#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1762#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1783#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1784#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1786#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1804#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1802#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1800#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1798#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1796#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1794#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1793#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1792#L23-3 assume !(main_~i~0 < 5); 1781#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1782#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1788#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1789#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1813#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1812#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1811#L28-4 main_~nc_B~0 := 0; 1810#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1809#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1808#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1778#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1779#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1780#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1771#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1772#L41-2 [2018-12-02 03:50:40,931 INFO L796 eck$LassoCheckResult]: Loop: 1772#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1773#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1772#L41-2 [2018-12-02 03:50:40,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:40,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1838772157, now seen corresponding path program 2 times [2018-12-02 03:50:40,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:40,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:40,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:40,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:40,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:40,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2018-12-02 03:50:40,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:40,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:40,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:40,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:40,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:40,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1828481626, now seen corresponding path program 2 times [2018-12-02 03:50:40,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:40,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:40,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:42,851 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 273 DAG size of output: 209 [2018-12-02 03:50:42,988 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-02 03:50:42,989 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:42,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:42,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:42,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:42,990 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:42,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:42,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:42,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:42,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-12-02 03:50:42,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:42,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:42,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:42,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:42,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:42,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:42,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:42,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:42,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:42,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:43,487 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:43,487 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:43,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,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-12-02 03:50:43,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,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-12-02 03:50:43,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:43,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:43,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:43,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:43,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,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-12-02 03:50:43,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,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-12-02 03:50:43,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:43,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:43,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:43,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,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-12-02 03:50:43,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:43,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:43,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:50:43,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,500 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:50:43,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:43,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:43,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:43,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:43,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:43,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:43,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:43,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:43,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:43,516 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:43,533 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-12-02 03:50:43,533 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-02 03:50:43,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:43,534 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:43,534 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:43,534 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-12-02 03:50:43,609 INFO L297 tatePredicateManager]: 27 out of 29 supporting invariants were superfluous and have been removed [2018-12-02 03:50:43,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:43,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:43,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:43,678 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-12-02 03:50:43,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 61 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-12-02 03:50:43,716 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 61 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 66 states and 80 transitions. Complement of second has 9 states. [2018-12-02 03:50:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-02 03:50:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 03:50:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-12-02 03:50:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-02 03:50:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 42 letters. Loop has 2 letters. [2018-12-02 03:50:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-02 03:50:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:43,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2018-12-02 03:50:43,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:43,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 64 states and 76 transitions. [2018-12-02 03:50:43,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-02 03:50:43,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-12-02 03:50:43,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 76 transitions. [2018-12-02 03:50:43,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:43,718 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-02 03:50:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 76 transitions. [2018-12-02 03:50:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-12-02 03:50:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 03:50:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-12-02 03:50:43,720 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-02 03:50:43,720 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-02 03:50:43,720 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 03:50:43,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 61 transitions. [2018-12-02 03:50:43,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:43,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:43,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:43,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:43,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:43,721 INFO L794 eck$LassoCheckResult]: Stem: 2189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2186#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 2164#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2165#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2166#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2167#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2209#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2207#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2205#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2203#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2201#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2197#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2196#L19-3 assume !(main_~i~0 < 5); 2162#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2163#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2184#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2185#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2188#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2210#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2208#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2206#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2204#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2202#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2200#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2199#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2198#L23-3 assume !(main_~i~0 < 5); 2182#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2183#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2192#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2170#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2171#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2195#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2193#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2194#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2190#L28-4 main_~nc_B~0 := 0; 2191#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2214#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2213#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2212#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2172#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2173#L41-2 [2018-12-02 03:50:43,721 INFO L796 eck$LassoCheckResult]: Loop: 2173#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2174#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2173#L41-2 [2018-12-02 03:50:43,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1123035027, now seen corresponding path program 3 times [2018-12-02 03:50:43,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:43,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:43,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:43,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 03:50:43,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:43,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:43,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:50:43,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 03:50:43,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:50:43,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 03:50:43,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:43,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-12-02 03:50:43,828 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:50:43,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:43,828 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2018-12-02 03:50:43,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:43,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:43,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 03:50:43,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:50:43,878 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. cyclomatic complexity: 14 Second operand 13 states. [2018-12-02 03:50:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:43,929 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-02 03:50:43,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:50:43,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2018-12-02 03:50:43,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 03:50:43,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 60 states and 69 transitions. [2018-12-02 03:50:43,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-02 03:50:43,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-02 03:50:43,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2018-12-02 03:50:43,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:43,931 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-12-02 03:50:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2018-12-02 03:50:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-12-02 03:50:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 03:50:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-12-02 03:50:43,932 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-02 03:50:43,932 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-02 03:50:43,932 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 03:50:43,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 63 transitions. [2018-12-02 03:50:43,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:43,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:43,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:43,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:43,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:43,933 INFO L794 eck$LassoCheckResult]: Stem: 2444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2440#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 2418#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2419#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2420#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2421#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2462#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2460#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2458#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2456#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2454#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2450#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2449#L19-3 assume !(main_~i~0 < 5); 2416#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2417#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2438#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2439#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2443#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2463#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2461#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2459#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2457#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2455#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2453#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2452#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2451#L23-3 assume !(main_~i~0 < 5); 2436#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2437#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2447#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2448#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2470#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2469#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2445#L28-4 main_~nc_B~0 := 0; 2446#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2468#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2467#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2441#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2442#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2464#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2431#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2427#L41-2 [2018-12-02 03:50:43,933 INFO L796 eck$LassoCheckResult]: Loop: 2427#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2428#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2427#L41-2 [2018-12-02 03:50:43,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:43,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2018-12-02 03:50:43,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:43,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:43,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:43,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:43,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2018-12-02 03:50:43,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:43,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:43,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2018-12-02 03:50:43,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:43,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-02 03:50:44,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:44,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:44,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:44,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-02 03:50:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:44,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-12-02 03:50:44,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 03:50:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:50:44,130 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. cyclomatic complexity: 14 Second operand 11 states. [2018-12-02 03:50:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:44,220 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-12-02 03:50:44,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:50:44,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 73 transitions. [2018-12-02 03:50:44,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:44,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 46 states and 50 transitions. [2018-12-02 03:50:44,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-02 03:50:44,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 03:50:44,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2018-12-02 03:50:44,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:44,221 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-02 03:50:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2018-12-02 03:50:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-02 03:50:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 03:50:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 03:50:44,223 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 03:50:44,223 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 03:50:44,223 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 03:50:44,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2018-12-02 03:50:44,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:44,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:44,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:44,223 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:44,223 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:44,223 INFO L794 eck$LassoCheckResult]: Stem: 2715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2712#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 2692#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2693#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2694#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2695#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2725#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2724#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2723#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2722#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2721#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2719#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2718#L19-3 assume !(main_~i~0 < 5); 2690#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2691#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2713#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2714#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2709#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2710#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2733#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2732#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2730#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2729#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2728#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2727#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2726#L23-3 assume !(main_~i~0 < 5); 2707#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2708#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2716#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2698#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2699#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2717#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2720#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2696#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2697#L28-4 main_~nc_B~0 := 0; 2703#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2704#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2705#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2706#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2731#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2711#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2700#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2701#L41-2 [2018-12-02 03:50:44,223 INFO L796 eck$LassoCheckResult]: Loop: 2701#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2702#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2701#L41-2 [2018-12-02 03:50:44,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:44,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1199820568, now seen corresponding path program 4 times [2018-12-02 03:50:44,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:44,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:44,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:44,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:44,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:44,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2018-12-02 03:50:44,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:44,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:44,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:44,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327925, now seen corresponding path program 3 times [2018-12-02 03:50:44,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:44,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:44,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:44,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:44,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:48,564 WARN L180 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 285 DAG size of output: 213 [2018-12-02 03:50:48,716 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-02 03:50:48,717 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:48,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:48,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:48,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:48,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:48,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:48,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:48,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:48,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration16_Lasso [2018-12-02 03:50:48,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:48,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:48,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-12-02 03:50:48,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-12-02 03:50:48,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-12-02 03:50:48,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:48,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-12-02 03:50:48,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:48,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:48,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:48,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:48,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,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-12-02 03:50:49,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,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-12-02 03:50:49,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:49,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:49,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:49,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:49,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:49,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:49,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:49,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:49,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:49,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:49,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:49,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:49,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,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-12-02 03:50:49,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:49,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:49,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:49,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:49,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:49,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:49,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:49,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:49,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:49,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,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-12-02 03:50:49,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,235 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-02 03:50:49,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,236 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 03:50:49,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,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-12-02 03:50:49,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,244 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:50:49,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,244 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:50:49,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:49,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:49,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:49,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:49,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:49,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:49,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:49,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:49,252 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:49,260 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 03:50:49,260 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 03:50:49,260 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:49,261 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:49,261 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:49,261 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_6) = -1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_6 Supporting invariants [] [2018-12-02 03:50:49,332 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-12-02 03:50:49,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:50:49,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:49,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:49,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:49,378 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-12-02 03:50:49,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 03:50:49,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 48 states and 54 transitions. Complement of second has 5 states. [2018-12-02 03:50:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:50:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-02 03:50:49,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 42 letters. Loop has 2 letters. [2018-12-02 03:50:49,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:49,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 44 letters. Loop has 2 letters. [2018-12-02 03:50:49,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:49,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 42 letters. Loop has 4 letters. [2018-12-02 03:50:49,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:49,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 54 transitions. [2018-12-02 03:50:49,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:49,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 54 transitions. [2018-12-02 03:50:49,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 03:50:49,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 03:50:49,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 54 transitions. [2018-12-02 03:50:49,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:49,387 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-02 03:50:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 54 transitions. [2018-12-02 03:50:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 03:50:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 03:50:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-02 03:50:49,388 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-02 03:50:49,388 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-02 03:50:49,388 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-02 03:50:49,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2018-12-02 03:50:49,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:49,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:49,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:49,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:49,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:49,389 INFO L794 eck$LassoCheckResult]: Stem: 3064#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3061#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 3037#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3038#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3039#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3040#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3075#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3073#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3072#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3071#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3070#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3068#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3067#L19-3 assume !(main_~i~0 < 5); 3035#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3036#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3062#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3063#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3058#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3059#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3082#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3081#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3080#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3079#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3078#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3077#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3076#L23-3 assume !(main_~i~0 < 5); 3056#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3057#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3065#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3043#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3044#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3066#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3069#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3041#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3042#L28-4 main_~nc_B~0 := 0; 3052#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3053#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3054#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3055#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3074#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3060#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3045#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3046#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3051#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3047#L41-2 [2018-12-02 03:50:49,389 INFO L796 eck$LassoCheckResult]: Loop: 3047#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3048#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 3047#L41-2 [2018-12-02 03:50:49,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2018-12-02 03:50:49,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:49,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:49,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2018-12-02 03:50:49,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:49,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:49,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:49,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:49,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2018-12-02 03:50:49,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:49,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:51,548 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 310 DAG size of output: 230 [2018-12-02 03:50:51,655 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-02 03:50:51,657 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:51,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:51,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:51,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:51,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:51,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:51,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:51,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:51,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration17_Lasso [2018-12-02 03:50:51,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:51,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:51,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50: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-12-02 03:50:51,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50: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-12-02 03:50:51,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:51,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:52,278 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-02 03:50:52,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:52,288 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:52,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:52,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:52,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:52,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:52,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:52,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:52,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:52,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:52,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:52,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:52,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:52,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:52,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:52,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:52,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:52,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:52,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:52,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:52,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:52,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:52,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:52,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:52,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:52,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:52,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:52,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:52,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:52,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:52,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:52,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:52,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:52,301 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:52,307 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 03:50:52,307 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 03:50:52,308 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:52,308 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:52,308 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:52,308 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-12-02 03:50:52,358 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-12-02 03:50:52,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:52,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:52,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:52,402 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-12-02 03:50:52,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-02 03:50:52,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 52 states and 60 transitions. Complement of second has 5 states. [2018-12-02 03:50:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:50:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-02 03:50:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2018-12-02 03:50:52,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:52,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-02 03:50:52,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:52,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2018-12-02 03:50:52,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:52,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-12-02 03:50:52,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:52,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2018-12-02 03:50:52,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-02 03:50:52,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 03:50:52,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2018-12-02 03:50:52,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:52,413 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-02 03:50:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2018-12-02 03:50:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 03:50:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 03:50:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-12-02 03:50:52,415 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-02 03:50:52,415 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-02 03:50:52,415 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-02 03:50:52,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-12-02 03:50:52,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:52,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:52,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:52,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:52,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:52,417 INFO L794 eck$LassoCheckResult]: Stem: 3424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3421#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 3396#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3397#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3398#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3399#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3434#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3433#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3432#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3431#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3430#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3428#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3427#L19-3 assume !(main_~i~0 < 5); 3394#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3395#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3419#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3420#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3423#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3443#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3442#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3441#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3440#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3439#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3438#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3437#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3436#L23-3 assume !(main_~i~0 < 5); 3415#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3416#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3425#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3402#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3403#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3426#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3429#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3400#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3401#L28-4 main_~nc_B~0 := 0; 3411#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3412#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3413#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3414#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3435#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3422#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3404#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3405#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3417#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3418#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3410#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3406#L41-2 [2018-12-02 03:50:52,417 INFO L796 eck$LassoCheckResult]: Loop: 3406#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3407#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 3406#L41-2 [2018-12-02 03:50:52,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2018-12-02 03:50:52,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 9 times [2018-12-02 03:50:52,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,442 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2018-12-02 03:50:52,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 03:50:52,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:52,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:50:52,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 03:50:52,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:50:52,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 03:50:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-02 03:50:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 03:50:52,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:50:52,589 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-02 03:50:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:52,688 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-12-02 03:50:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:50:52,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-12-02 03:50:52,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:52,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 55 states and 63 transitions. [2018-12-02 03:50:52,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 03:50:52,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 03:50:52,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-12-02 03:50:52,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:52,689 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-02 03:50:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-12-02 03:50:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-02 03:50:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 03:50:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-12-02 03:50:52,690 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-02 03:50:52,690 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-02 03:50:52,690 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-02 03:50:52,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-12-02 03:50:52,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:52,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:52,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:52,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:52,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:52,691 INFO L794 eck$LassoCheckResult]: Stem: 3710#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3707#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 3684#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3685#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3686#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3687#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3720#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3719#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3718#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3717#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3716#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3714#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3713#L19-3 assume !(main_~i~0 < 5); 3682#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3683#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3705#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3706#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3709#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3730#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3729#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3728#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3727#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3726#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3725#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3724#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3723#L23-3 assume !(main_~i~0 < 5); 3703#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3704#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3711#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3690#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3691#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3712#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3715#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3688#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3689#L28-4 main_~nc_B~0 := 0; 3699#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3700#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3701#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3702#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3731#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3722#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3721#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3708#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3692#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3693#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3733#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3732#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3698#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3694#L41-2 [2018-12-02 03:50:52,691 INFO L796 eck$LassoCheckResult]: Loop: 3694#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3695#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 3694#L41-2 [2018-12-02 03:50:52,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash 356019245, now seen corresponding path program 4 times [2018-12-02 03:50:52,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 10 times [2018-12-02 03:50:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1462886640, now seen corresponding path program 4 times [2018-12-02 03:50:52,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-02 03:50:52,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:50:52,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a69c2fe-9d1c-49c9-9f4b-c0ad8b54564a/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-12-02 03:50:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 03:50:52,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 03:50:52,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:50:52,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-02 03:50:52,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:50:52,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-02 03:50:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 03:50:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:50:52,856 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-02 03:50:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:50:52,916 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-02 03:50:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:50:52,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 90 transitions. [2018-12-02 03:50:52,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:52,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 57 states and 65 transitions. [2018-12-02 03:50:52,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 03:50:52,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 03:50:52,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-02 03:50:52,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:52,917 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-02 03:50:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-02 03:50:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-02 03:50:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 03:50:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-02 03:50:52,919 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-02 03:50:52,919 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-02 03:50:52,919 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-02 03:50:52,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-12-02 03:50:52,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 03:50:52,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:52,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:52,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:52,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:52,920 INFO L794 eck$LassoCheckResult]: Stem: 4014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4011#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 3987#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3988#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3989#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3990#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4027#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4024#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4023#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4022#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4021#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4018#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4017#L19-3 assume !(main_~i~0 < 5); 3985#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3986#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4009#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4010#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4013#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4036#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4035#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4034#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4033#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4032#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4031#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4030#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4029#L23-3 assume !(main_~i~0 < 5); 4006#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4007#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4015#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3993#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3994#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4016#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4037#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4020#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4019#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3991#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3992#L28-4 main_~nc_B~0 := 0; 4002#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4003#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4004#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4005#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4028#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4026#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4025#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4012#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3995#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3996#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4000#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4008#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4038#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3997#L41-2 [2018-12-02 03:50:52,920 INFO L796 eck$LassoCheckResult]: Loop: 3997#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3998#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 3997#L41-2 [2018-12-02 03:50:52,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 5 times [2018-12-02 03:50:52,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 11 times [2018-12-02 03:50:52,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 5 times [2018-12-02 03:50:52,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:52,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:52,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:52,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:56,244 WARN L180 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 358 DAG size of output: 271 [2018-12-02 03:50:56,509 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-12-02 03:50:56,511 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:50:56,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:50:56,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:50:56,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:50:56,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:50:56,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:50:56,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:50:56,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:50:56,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration20_Lasso [2018-12-02 03:50:56,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:50:56,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:50:56,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:56,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:57,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-12-02 03:50:57,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:57,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-12-02 03:50:57,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:50:57,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-12-02 03:50:57,143 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 03:50:57,938 WARN L180 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-12-02 03:50:57,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:50:57,947 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:50:57,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:57,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:57,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:57,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:57,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:50:57,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:50:57,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:50:57,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:57,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:57,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:57,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:57,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:57,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:57,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:50:57,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:50:57,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:50:57,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:50:57,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:50:57,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:50:57,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:50:57,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:50:57,977 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:50:57,986 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 03:50:57,986 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-02 03:50:57,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:50:57,987 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:50:57,987 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:50:57,987 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_8, ULTIMATE.start_main_~#string_B~0.offset) = -1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_8 - 1*ULTIMATE.start_main_~#string_B~0.offset Supporting invariants [] [2018-12-02 03:50:58,095 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-02 03:50:58,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:50:58,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:58,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:58,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:58,139 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-12-02 03:50:58,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-02 03:50:58,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-12-02 03:50:58,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:50:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-02 03:50:58,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-02 03:50:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:58,148 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 03:50:58,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:58,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:58,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:58,188 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 03:50:58,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-02 03:50:58,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-12-02 03:50:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:50:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-02 03:50:58,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-02 03:50:58,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:58,202 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 03:50:58,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:58,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:50:58,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:50:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:50:58,246 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 2 loop predicates [2018-12-02 03:50:58,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-02 03:50:58,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 60 states and 71 transitions. Complement of second has 4 states. [2018-12-02 03:50:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:50:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:50:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-12-02 03:50:58,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-02 03:50:58,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:58,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2018-12-02 03:50:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:58,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2018-12-02 03:50:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:50:58,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2018-12-02 03:50:58,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:50:58,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2018-12-02 03:50:58,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-02 03:50:58,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 03:50:58,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-12-02 03:50:58,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:50:58,256 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-02 03:50:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-12-02 03:50:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-12-02 03:50:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 03:50:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-02 03:50:58,258 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-02 03:50:58,258 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-02 03:50:58,258 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-02 03:50:58,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2018-12-02 03:50:58,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:50:58,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:50:58,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:50:58,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:50:58,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:50:58,259 INFO L794 eck$LassoCheckResult]: Stem: 4893#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4888#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 4867#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4868#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4869#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4870#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4905#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4904#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4903#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4901#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4900#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4897#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4896#L19-3 assume !(main_~i~0 < 5); 4865#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4866#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4891#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4892#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4886#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4887#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4914#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4913#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4912#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4911#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4910#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4909#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4908#L23-3 assume !(main_~i~0 < 5); 4884#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4885#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4894#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4873#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4874#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4895#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4902#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4899#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4898#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4871#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4872#L28-4 main_~nc_B~0 := 0; 4880#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4881#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4882#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4883#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4890#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4907#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4906#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4889#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4875#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4876#L41-2 [2018-12-02 03:50:58,259 INFO L796 eck$LassoCheckResult]: Loop: 4876#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4877#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4876#L41-2 [2018-12-02 03:50:58,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 5 times [2018-12-02 03:50:58,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:58,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:58,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:58,278 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2018-12-02 03:50:58,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:58,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:58,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:50:58,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:58,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:50:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2018-12-02 03:50:58,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:50:58,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:50:58,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:58,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:50:58,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:50:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:50:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:51:03,298 WARN L180 SmtUtils]: Spent 4.95 s on a formula simplification. DAG size of input: 309 DAG size of output: 232 [2018-12-02 03:51:03,428 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-02 03:51:03,431 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:51:03,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:51:03,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:51:03,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:51:03,431 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:51:03,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:51:03,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:51:03,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:51:03,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration21_Lasso [2018-12-02 03:51:03,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:51:03,431 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:51:03,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,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-12-02 03:51:03,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,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-12-02 03:51:03,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,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-12-02 03:51:03,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:03,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:04,100 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:51:04,100 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:51:04,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:04,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:04,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:04,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:04,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:04,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:04,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:04,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,109 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:51:04,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,109 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:51:04,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:04,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:04,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:04,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:04,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:04,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:04,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:04,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:04,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:04,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:04,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:04,119 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:51:04,129 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 03:51:04,129 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 03:51:04,129 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:51:04,129 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:51:04,130 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:51:04,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_9) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_9 Supporting invariants [] [2018-12-02 03:51:04,260 INFO L297 tatePredicateManager]: 44 out of 46 supporting invariants were superfluous and have been removed [2018-12-02 03:51:04,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:51:04,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:51:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:51:04,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:51:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:51:04,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:51:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:51:04,314 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 03:51:04,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-02 03:51:04,344 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 59 states and 69 transitions. Complement of second has 7 states. [2018-12-02 03:51:04,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-02 03:51:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 03:51:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-02 03:51:04,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-02 03:51:04,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:51:04,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2018-12-02 03:51:04,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:51:04,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2018-12-02 03:51:04,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:51:04,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-12-02 03:51:04,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:51:04,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2018-12-02 03:51:04,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-02 03:51:04,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 03:51:04,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-02 03:51:04,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:51:04,346 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-02 03:51:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-02 03:51:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-12-02 03:51:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 03:51:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-12-02 03:51:04,347 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-02 03:51:04,347 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-02 03:51:04,347 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-02 03:51:04,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2018-12-02 03:51:04,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:51:04,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:51:04,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:51:04,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:51:04,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 03:51:04,348 INFO L794 eck$LassoCheckResult]: Stem: 5366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5362#L-1 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;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);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; 5338#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5339#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5340#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5341#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5378#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5377#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5376#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5374#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5373#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5370#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5369#L19-3 assume !(main_~i~0 < 5); 5336#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 5337#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 5360#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5361#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5365#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5388#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5387#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5386#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5385#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5384#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5383#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5382#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5381#L23-3 assume !(main_~i~0 < 5); 5355#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 5356#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 5367#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5344#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5345#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5368#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5375#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5372#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5371#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5342#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 5343#L28-4 main_~nc_B~0 := 0; 5351#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5352#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5353#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5354#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5364#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5380#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5379#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5363#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 5346#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 5347#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5349#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 5359#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5357#L41 [2018-12-02 03:51:04,348 INFO L796 eck$LassoCheckResult]: Loop: 5357#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 5358#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5357#L41 [2018-12-02 03:51:04,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:51:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 4 times [2018-12-02 03:51:04,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:51:04,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:51:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:51:04,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:51:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:51:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:51:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:51:04,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:51:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2018-12-02 03:51:04,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:51:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:51:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:51:04,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:51:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:51:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:51:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:51:04,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:51:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 6 times [2018-12-02 03:51:04,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:51:04,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:51:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:51:04,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:51:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:51:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:51:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:51:10,122 WARN L180 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 348 DAG size of output: 258 [2018-12-02 03:51:10,424 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-02 03:51:10,426 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:51:10,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:51:10,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:51:10,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:51:10,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:51:10,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:51:10,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:51:10,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:51:10,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration22_Lasso [2018-12-02 03:51:10,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:51:10,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:51:10,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,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-12-02 03:51:10,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,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-12-02 03:51:10,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,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-12-02 03:51:10,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-12-02 03:51:10,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:10,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:51:11,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:51:11,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:51:11,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,299 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:51:11,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,299 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:51:11,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,302 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-12-02 03:51:11,302 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:51:11,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,306 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-12-02 03:51:11,306 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 03:51:11,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,333 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:51:11,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,333 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:51:11,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:51:11,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:51:11,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:51:11,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:51:11,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:51:11,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:51:11,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:51:11,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:51:11,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:51:11,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:51:11,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:51:11,343 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:51:11,348 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 03:51:11,348 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 03:51:11,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:51:11,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:51:11,349 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:51:11,349 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_10, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_10 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-02 03:51:11,466 INFO L297 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2018-12-02 03:51:11,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:51:11,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:51:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:51:11,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:51:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:51:11,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:51:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:51:11,524 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 03:51:11,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-02 03:51:11,557 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 66 states and 77 transitions. Complement of second has 7 states. [2018-12-02 03:51:11,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 03:51:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 03:51:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-02 03:51:11,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2018-12-02 03:51:11,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:51:11,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2018-12-02 03:51:11,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:51:11,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2018-12-02 03:51:11,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:51:11,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-12-02 03:51:11,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 03:51:11,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-12-02 03:51:11,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 03:51:11,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 03:51:11,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 03:51:11,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:51:11,558 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:51:11,558 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:51:11,558 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:51:11,558 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-02 03:51:11,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 03:51:11,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 03:51:11,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 03:51:11,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:51:11 BoogieIcfgContainer [2018-12-02 03:51:11,563 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 03:51:11,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:51:11,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:51:11,563 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:51:11,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:50:29" (3/4) ... [2018-12-02 03:51:11,565 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 03:51:11,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:51:11,566 INFO L168 Benchmark]: Toolchain (without parser) took 42497.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 119.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:51:11,567 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:51:11,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.39 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:51:11,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.57 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:51:11,567 INFO L168 Benchmark]: Boogie Preprocessor took 50.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 03:51:11,568 INFO L168 Benchmark]: RCFGBuilder took 180.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:51:11,568 INFO L168 Benchmark]: BuchiAutomizer took 42097.06 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.6 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2018-12-02 03:51:11,568 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:51:11,570 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.39 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.57 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 180.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42097.06 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.6 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 - 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 22 terminating modules (12 trivial, 9 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[string_A] + -2 * i 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 3 locations. One deterministic module has affine ranking function -1 * string_B + -1 * nc_B + unknown-#length-unknown[string_B] and consists of 3 locations. One deterministic module has affine ranking function -1 * i + nc_B and consists of 9 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 7 locations. One deterministic module has affine ranking function -1 * string_B + -1 * j + unknown-#length-unknown[string_B] and consists of 3 locations. One deterministic module has affine ranking function -1 * i + nc_A and consists of 3 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[string_A] and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[string_A] + j and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + unknown-#length-unknown[string_B] + -1 * string_B and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.0s and 23 iterations. TraceHistogramMax:5. Analysis of lassos took 40.3s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 82 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 19. Nontrivial modules had stage [9, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 399 SDtfs, 502 SDslu, 534 SDs, 0 SdLazy, 856 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU7 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax100 hnf99 lsp96 ukn45 mio100 lsp59 div100 bol100 ite100 ukn100 eq171 hnf85 smp94 dnf264 smp90 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 7 VariablesLoop: 7 DisjunctsStem: 8 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 44 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...