./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_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:01,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:49:01,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:49:01,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:49:01,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:49:01,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:49:01,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:49:01,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:49:01,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:49:01,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:49:01,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:49:01,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:49:01,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:49:01,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:49:01,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:49:01,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:49:01,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:49:01,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:49:01,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:49:01,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:49:01,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:49:01,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:49:01,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:49:01,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:49:01,140 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:49:01,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:49:01,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:49:01,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:49:01,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:49:01,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:49:01,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:49:01,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:49:01,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:49:01,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:49:01,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:49:01,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:49:01,144 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 08:49:01,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:49:01,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:49:01,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:49:01,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:49:01,153 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:49:01,153 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 08:49:01,153 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 08:49:01,153 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 08:49:01,153 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 08:49:01,153 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 08:49:01,153 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 08:49:01,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 08:49:01,154 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:49:01,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 08:49:01,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:49:01,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:49:01,155 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 08:49:01,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:49:01,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:49:01,155 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 08:49:01,156 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 08:49:01,156 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_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:01,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:49:01,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:49:01,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:49:01,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:49:01,182 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:49:01,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-12-08 08:49:01,217 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/data/a30754734/58a92f98a90043f780403b25c8870995/FLAGc70312cd4 [2018-12-08 08:49:01,582 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:49:01,583 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-12-08 08:49:01,586 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/data/a30754734/58a92f98a90043f780403b25c8870995/FLAGc70312cd4 [2018-12-08 08:49:01,961 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/bin-2019/uautomizer/data/a30754734/58a92f98a90043f780403b25c8870995 [2018-12-08 08:49:01,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:49:01,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:49:01,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:49:01,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:49:01,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:49:01,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:49:01" (1/1) ... [2018-12-08 08:49:01,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ed00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:01, skipping insertion in model container [2018-12-08 08:49:01,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:49:01" (1/1) ... [2018-12-08 08:49:01,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:49:01,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:49:02,080 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:49:02,083 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:49:02,096 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:49:02,107 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:49:02,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02 WrapperNode [2018-12-08 08:49:02,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:49:02,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:49:02,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:49:02,108 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:49:02,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:49:02,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:49:02,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:49:02,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:49:02,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... [2018-12-08 08:49:02,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:49:02,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:49:02,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:49:02,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:49:02,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 08:49:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:49:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:49:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:49:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 08:49:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:49:02,354 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:49:02,354 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-08 08:49:02,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:49:02 BoogieIcfgContainer [2018-12-08 08:49:02,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:49:02,355 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 08:49:02,355 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 08:49:02,358 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 08:49:02,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:49:02,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:49:01" (1/3) ... [2018-12-08 08:49:02,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32e1a9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:49:02, skipping insertion in model container [2018-12-08 08:49:02,361 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:49:02,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:49:02" (2/3) ... [2018-12-08 08:49:02,361 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32e1a9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:49:02, skipping insertion in model container [2018-12-08 08:49:02,361 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:49:02,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:49:02" (3/3) ... [2018-12-08 08:49:02,363 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-12-08 08:49:02,403 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:49:02,403 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 08:49:02,403 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 08:49:02,403 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 08:49:02,403 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:49:02,403 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:49:02,403 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 08:49:02,403 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:49:02,403 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 08:49:02,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-08 08:49:02,424 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-08 08:49:02,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:02,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:02,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 08:49:02,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:02,429 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 08:49:02,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-08 08:49:02,430 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-08 08:49:02,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:02,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:02,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 08:49:02,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:02,435 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-08 08:49:02,435 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-08 08:49:02,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 08:49:02,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:02,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:02,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-08 08:49:02,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:02,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-08 08:49:02,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:02,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:02,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:02,636 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:02,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:02,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:02,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:02,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:02,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:02,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:02,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:02,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-08 08:49:02,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:02,638 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:02,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:02,656 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-08 08:49:02,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:02,658 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-08 08:49:02,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-08 08:49:02,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-08 08:49:02,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-08 08:49:02,667 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-08 08:49:02,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:02,669 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-08 08:49:02,671 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-08 08:49:02,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-08 08:49:02,673 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-08 08:49:02,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-08 08:49:02,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-08 08:49:02,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-08 08:49:02,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-08 08:49:02,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-08 08:49:02,714 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-08 08:49:02,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:02,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:02,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-08 08:49:02,854 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:02,857 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:02,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:02,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:02,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:02,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:02,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:02,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:02,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:02,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:02,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:02,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:02,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:02,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:02,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:02,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:02,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:02,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:02,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,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-08 08:49:02,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:02,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:02,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:02,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:02,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:02,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:02,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:02,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:02,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:02,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:02,937 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:02,965 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 08:49:02,965 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 08:49:02,967 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:02,968 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:02,968 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:02,969 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-08 08:49:02,977 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 08:49:02,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:49:02,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:03,033 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-08 08:49:03,042 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-08 08:49:03,043 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-08 08:49:03,078 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-08 08:49:03,079 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-08 08:49:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-08 08:49:03,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-08 08:49:03,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:03,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-08 08:49:03,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:03,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-08 08:49:03,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:03,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2018-12-08 08:49:03,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2018-12-08 08:49:03,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 08:49:03,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-08 08:49:03,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-12-08 08:49:03,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:03,088 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-08 08:49:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-12-08 08:49:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-08 08:49:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-08 08:49:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-12-08 08:49:03,108 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-08 08:49:03,108 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-08 08:49:03,108 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 08:49:03,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-12-08 08:49:03,109 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:03,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:03,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:49:03,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:03,109 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-08 08:49:03,109 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-08 08:49:03,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-12-08 08:49:03,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,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-08 08:49:03,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:49:03,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:49:03,141 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:49:03,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-12-08 08:49:03,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:03,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:49:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:49:03,181 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-08 08:49:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:03,204 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-12-08 08:49:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:49:03,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-12-08 08:49:03,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2018-12-08 08:49:03,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-08 08:49:03,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-08 08:49:03,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-12-08 08:49:03,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:03,207 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-08 08:49:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-12-08 08:49:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-12-08 08:49:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 08:49:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-08 08:49:03,209 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-08 08:49:03,209 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-08 08:49:03,209 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 08:49:03,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-08 08:49:03,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:03,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:03,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:49:03,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:03,210 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-08 08:49:03,210 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-08 08:49:03,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2018-12-08 08:49:03,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,226 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-08 08:49:03,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:03,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:03,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:03,248 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-08 08:49:03,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:03,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-08 08:49:03,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:49:03,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2018-12-08 08:49:03,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:03,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:49:03,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:49:03,297 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-08 08:49:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:03,328 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-08 08:49:03,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:49:03,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-12-08 08:49:03,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-12-08 08:49:03,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-08 08:49:03,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-08 08:49:03,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-12-08 08:49:03,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:03,329 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-08 08:49:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-12-08 08:49:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-08 08:49:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 08:49:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-08 08:49:03,331 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-08 08:49:03,331 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-08 08:49:03,331 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 08:49:03,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-12-08 08:49:03,331 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:03,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:03,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 08:49:03,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:03,332 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-08 08:49:03,332 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-08 08:49:03,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2018-12-08 08:49:03,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,350 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-08 08:49:03,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:03,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:03,373 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-08 08:49:03,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:03,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-08 08:49:03,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:49:03,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2018-12-08 08:49:03,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:49:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:49:03,419 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-12-08 08:49:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:03,458 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-08 08:49:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:49:03,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-08 08:49:03,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-12-08 08:49:03,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-08 08:49:03,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-08 08:49:03,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-12-08 08:49:03,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:03,460 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-12-08 08:49:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-12-08 08:49:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-08 08:49:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 08:49:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-08 08:49:03,462 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-08 08:49:03,462 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-08 08:49:03,462 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 08:49:03,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-12-08 08:49:03,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:03,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:03,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-12-08 08:49:03,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:03,464 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-08 08:49:03,464 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-08 08:49:03,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2018-12-08 08:49:03,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,494 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-08 08:49:03,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:03,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:03,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 08:49:03,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:49:03,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:49:03,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:03,517 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-08 08:49:03,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-08 08:49:03,531 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:49:03,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2018-12-08 08:49:03,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:49:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:49:03,559 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-12-08 08:49:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:03,604 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-12-08 08:49:03,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:49:03,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2018-12-08 08:49:03,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2018-12-08 08:49:03,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-08 08:49:03,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-08 08:49:03,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-12-08 08:49:03,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:03,606 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-08 08:49:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-12-08 08:49:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-12-08 08:49:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 08:49:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-08 08:49:03,608 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-08 08:49:03,608 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-08 08:49:03,608 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 08:49:03,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-12-08 08:49:03,609 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:03,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:03,610 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-12-08 08:49:03,610 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:03,610 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-08 08:49:03,610 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-08 08:49:03,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2018-12-08 08:49:03,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,640 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-08 08:49:03,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:03,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:03,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 08:49:03,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-08 08:49:03,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:49:03,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:03,673 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-08 08:49:03,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:03,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 08:49:03,693 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:49:03,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2018-12-08 08:49:03,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 08:49:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 08:49:03,722 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-08 08:49:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:03,764 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-12-08 08:49:03,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 08:49:03,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-12-08 08:49:03,765 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-12-08 08:49:03,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-08 08:49:03,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-08 08:49:03,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-12-08 08:49:03,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:03,766 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-08 08:49:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-12-08 08:49:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-12-08 08:49:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-08 08:49:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-08 08:49:03,769 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-08 08:49:03,769 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-08 08:49:03,769 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 08:49:03,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-12-08 08:49:03,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 08:49:03,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:03,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:03,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-12-08 08:49:03,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:03,770 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-08 08:49:03,770 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-08 08:49:03,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2018-12-08 08:49:03,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2018-12-08 08:49:03,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2018-12-08 08:49:03,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:03,925 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-08 08:49:03,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:49:03,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 08:49:03,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:49:03,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:49:03,941 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-08 08:49:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:03,981 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-08 08:49:03,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:49:03,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-12-08 08:49:03,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 08:49:03,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-12-08 08:49:03,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 08:49:03,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 08:49:03,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-12-08 08:49:03,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:03,982 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-08 08:49:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-12-08 08:49:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-08 08:49:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-08 08:49:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-08 08:49:03,984 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-08 08:49:03,984 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-08 08:49:03,984 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 08:49:03,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-12-08 08:49:03,984 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 08:49:03,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:03,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:03,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:49:03,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:03,985 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-08 08:49:03,985 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-08 08:49:03,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2018-12-08 08:49:03,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:03,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:03,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:03,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:04,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:04,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2018-12-08 08:49:04,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:04,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:04,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:04,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:04,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:04,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2018-12-08 08:49:04,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:04,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:04,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:04,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:04,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:06,445 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-12-08 08:49:06,538 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:06,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:06,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:06,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:06,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:06,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:06,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:06,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:06,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration8_Lasso [2018-12-08 08:49:06,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:06,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:06,542 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-08 08:49:06,544 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-08 08:49:06,545 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-08 08:49:06,546 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-08 08:49:06,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:06,561 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-08 08:49:06,636 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-08 08:49:06,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:06,737 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:06,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:06,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,777 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:06,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,778 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:06,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,784 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:06,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,785 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:06,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:06,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:06,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:06,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:06,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:06,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:06,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:06,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:06,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:06,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:06,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:06,807 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:06,812 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 08:49:06,812 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 08:49:06,813 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:06,814 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:06,814 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:06,814 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-08 08:49:06,828 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 08:49:06,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:49:06,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:06,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:06,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:06,870 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-08 08:49:06,870 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-08 08:49:06,870 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 08:49:06,882 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-08 08:49:06,882 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-08 08:49:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-08 08:49:06,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2018-12-08 08:49:06,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:06,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2018-12-08 08:49:06,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:06,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-08 08:49:06,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:06,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-12-08 08:49:06,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:49:06,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-12-08 08:49:06,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-08 08:49:06,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 08:49:06,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-08 08:49:06,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:06,885 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-08 08:49:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-08 08:49:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-08 08:49:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-08 08:49:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-08 08:49:06,886 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-08 08:49:06,886 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-08 08:49:06,886 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 08:49:06,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-12-08 08:49:06,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:49:06,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:06,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:06,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:49:06,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:06,887 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-08 08:49:06,887 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-08 08:49:06,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2018-12-08 08:49:06,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:06,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:06,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:06,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2018-12-08 08:49:06,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:06,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:06,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2018-12-08 08:49:06,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:06,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:06,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:06,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:06,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,265 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 224 DAG size of output: 171 [2018-12-08 08:49:09,376 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-08 08:49:09,378 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:09,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:09,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:09,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:09,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:09,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:09,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:09,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:09,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-08 08:49:09,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:09,378 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:09,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,385 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-08 08:49:09,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,387 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-08 08:49:09,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,394 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-08 08:49:09,395 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-08 08:49:09,396 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-08 08:49:09,397 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-08 08:49:09,398 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-08 08:49:09,398 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-08 08:49:09,402 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-08 08:49:09,403 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-08 08:49:09,404 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-08 08:49:09,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:09,478 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-08 08:49:09,572 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:09,572 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:09,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:09,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:09,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:09,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:09,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:09,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:09,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:09,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:09,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:09,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:09,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:09,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:09,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:09,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:09,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:09,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:09,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:09,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:09,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:09,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:09,596 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:09,601 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 08:49:09,602 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 08:49:09,602 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:09,602 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:09,602 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:09,602 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-08 08:49:09,610 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 08:49:09,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:49:09,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:09,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:09,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:09,646 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-08 08:49:09,647 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-08 08:49:09,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-08 08:49:09,656 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-08 08:49:09,656 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-08 08:49:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-08 08:49:09,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2018-12-08 08:49:09,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:09,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2018-12-08 08:49:09,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:09,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2018-12-08 08:49:09,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:09,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-12-08 08:49:09,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:09,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2018-12-08 08:49:09,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-08 08:49:09,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 08:49:09,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-12-08 08:49:09,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:09,659 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-08 08:49:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-12-08 08:49:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-08 08:49:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-08 08:49:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-08 08:49:09,662 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-08 08:49:09,662 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-08 08:49:09,662 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 08:49:09,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-12-08 08:49:09,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:09,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:09,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:09,663 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-08 08:49:09,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:09,663 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-08 08:49:09,663 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~mem12;havoc main_#t~mem11;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-08 08:49:09,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2018-12-08 08:49:09,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2018-12-08 08:49:09,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2018-12-08 08:49:09,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:09,714 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-08 08:49:09,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:49:09,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:49:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:49:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:49:09,744 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-08 08:49:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:09,751 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-08 08:49:09,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:49:09,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-12-08 08:49:09,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:09,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2018-12-08 08:49:09,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 08:49:09,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 08:49:09,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-12-08 08:49:09,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:09,766 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-08 08:49:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-12-08 08:49:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-08 08:49:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-08 08:49:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-08 08:49:09,767 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-08 08:49:09,767 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-08 08:49:09,767 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 08:49:09,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-12-08 08:49:09,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:09,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:09,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:09,768 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-08 08:49:09,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:09,768 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-08 08:49:09,768 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~mem12;havoc main_#t~mem11;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-08 08:49:09,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2018-12-08 08:49:09,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:09,795 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-08 08:49:09,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:09,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:09,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:09,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:09,830 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-08 08:49:09,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 08:49:09,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-12-08 08:49:09,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:49:09,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2018-12-08 08:49:09,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:09,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:49:09,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 08:49:09,880 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-08 08:49:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:09,908 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-08 08:49:09,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:49:09,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-12-08 08:49:09,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:09,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2018-12-08 08:49:09,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 08:49:09,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 08:49:09,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-12-08 08:49:09,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:09,909 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-08 08:49:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-12-08 08:49:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-08 08:49:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-08 08:49:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-08 08:49:09,911 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-08 08:49:09,911 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-08 08:49:09,911 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 08:49:09,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-12-08 08:49:09,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:09,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:09,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:09,911 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-08 08:49:09,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:09,912 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-08 08:49:09,912 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~mem12;havoc main_#t~mem11;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-08 08:49:09,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,912 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2018-12-08 08:49:09,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:09,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2018-12-08 08:49:09,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:09,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2018-12-08 08:49:09,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:12,790 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 261 DAG size of output: 199 [2018-12-08 08:49:12,948 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-08 08:49:12,950 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:12,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:12,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:12,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:12,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:12,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:12,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:12,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:12,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-08 08:49:12,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:12,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:12,954 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-08 08:49:12,955 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-08 08:49:12,956 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-08 08:49:12,957 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-08 08:49:13,171 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-08 08:49:13,172 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-08 08:49:13,173 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-08 08:49:13,174 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-08 08:49:13,175 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-08 08:49:13,176 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-08 08:49:13,176 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-08 08:49:13,177 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-08 08:49:13,178 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-08 08:49:13,179 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-08 08:49:13,180 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-08 08:49:13,180 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-08 08:49:13,181 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-08 08:49:13,182 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-08 08:49:13,182 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-08 08:49:13,375 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:13,375 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:13,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:13,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:13,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:13,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:13,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:13,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:13,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:13,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:13,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:13,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:13,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:13,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,379 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:13,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,380 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:13,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,386 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-08 08:49:13,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,387 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 08:49:13,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:13,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,396 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:13,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,397 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:13,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:13,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:13,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:13,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:13,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:13,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:13,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:13,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:13,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:13,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:13,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:13,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:13,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:13,427 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:13,452 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2018-12-08 08:49:13,452 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2018-12-08 08:49:13,453 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:13,453 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:13,453 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:13,453 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-08 08:49:13,492 INFO L297 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2018-12-08 08:49:13,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:13,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:13,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:13,599 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-08 08:49:13,599 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-08 08:49:13,599 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-08 08:49:13,664 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-08 08:49:13,664 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-08 08:49:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 08:49:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-12-08 08:49:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 38 letters. Loop has 2 letters. [2018-12-08 08:49:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-08 08:49:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:13,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 38 letters. Loop has 4 letters. [2018-12-08 08:49:13,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:13,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 71 transitions. [2018-12-08 08:49:13,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:13,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 71 transitions. [2018-12-08 08:49:13,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-08 08:49:13,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-12-08 08:49:13,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 71 transitions. [2018-12-08 08:49:13,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:13,667 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-12-08 08:49:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 71 transitions. [2018-12-08 08:49:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-12-08 08:49:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 08:49:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-12-08 08:49:13,668 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-08 08:49:13,668 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-08 08:49:13,668 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-08 08:49:13,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 61 transitions. [2018-12-08 08:49:13,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:13,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:13,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:13,669 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-08 08:49:13,669 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:13,669 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-08 08:49:13,669 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~mem12;havoc main_#t~mem11;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-08 08:49:13,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1838772157, now seen corresponding path program 2 times [2018-12-08 08:49:13,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:13,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:13,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:13,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:13,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:13,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:13,684 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2018-12-08 08:49:13,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:13,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:13,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:13,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1828481626, now seen corresponding path program 2 times [2018-12-08 08:49:13,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:13,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:13,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:15,521 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 273 DAG size of output: 209 [2018-12-08 08:49:15,657 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-08 08:49:15,658 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:15,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:15,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:15,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:15,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:15,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:15,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:15,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:15,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-12-08 08:49:15,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:15,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:15,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-08 08:49:15,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-08 08:49:15,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-08 08:49:15,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-08 08:49:15,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:15,667 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-08 08:49:15,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:15,670 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-08 08:49:15,670 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-08 08:49:15,671 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-08 08:49:15,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-08 08:49:15,961 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-08 08:49:15,962 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-08 08:49:15,963 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-08 08:49:15,964 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-08 08:49:15,965 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-08 08:49:15,966 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-08 08:49:15,967 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-08 08:49:15,968 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-08 08:49:16,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:16,154 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:16,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:16,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:16,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:16,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:16,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:16,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:16,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:16,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:16,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:16,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:16,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:16,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,166 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:16,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,166 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:16,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:16,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:16,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:16,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:16,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:16,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:16,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:16,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:16,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:16,177 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:16,188 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-12-08 08:49:16,189 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-08 08:49:16,189 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:16,189 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:16,189 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:16,189 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-08 08:49:16,249 INFO L297 tatePredicateManager]: 27 out of 29 supporting invariants were superfluous and have been removed [2018-12-08 08:49:16,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:16,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:16,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:16,316 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-08 08:49:16,317 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-08 08:49:16,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 61 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-12-08 08:49:16,357 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-08 08:49:16,357 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-08 08:49:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 08:49:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-12-08 08:49:16,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-08 08:49:16,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:16,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 42 letters. Loop has 2 letters. [2018-12-08 08:49:16,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:16,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-08 08:49:16,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:16,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2018-12-08 08:49:16,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:16,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 64 states and 76 transitions. [2018-12-08 08:49:16,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-08 08:49:16,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-12-08 08:49:16,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 76 transitions. [2018-12-08 08:49:16,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:16,361 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-08 08:49:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 76 transitions. [2018-12-08 08:49:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-12-08 08:49:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 08:49:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-12-08 08:49:16,363 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-08 08:49:16,363 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-08 08:49:16,363 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-08 08:49:16,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 61 transitions. [2018-12-08 08:49:16,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:16,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:16,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:16,364 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-08 08:49:16,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:16,364 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-08 08:49:16,364 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~mem12;havoc main_#t~mem11;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-08 08:49:16,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1123035027, now seen corresponding path program 3 times [2018-12-08 08:49:16,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:16,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:16,413 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-08 08:49:16,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:16,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:16,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 08:49:16,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 08:49:16,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:49:16,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:16,454 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-08 08:49:16,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:16,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-12-08 08:49:16,469 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:49:16,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2018-12-08 08:49:16,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 08:49:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-08 08:49:16,516 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. cyclomatic complexity: 14 Second operand 13 states. [2018-12-08 08:49:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:16,564 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-08 08:49:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:49:16,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2018-12-08 08:49:16,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:49:16,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 60 states and 69 transitions. [2018-12-08 08:49:16,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-08 08:49:16,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-08 08:49:16,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2018-12-08 08:49:16,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:16,566 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-12-08 08:49:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2018-12-08 08:49:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-12-08 08:49:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 08:49:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-12-08 08:49:16,568 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-08 08:49:16,568 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-08 08:49:16,568 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-08 08:49:16,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 63 transitions. [2018-12-08 08:49:16,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:16,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:16,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:16,569 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-08 08:49:16,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:16,569 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~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2427#L41-2 [2018-12-08 08:49:16,570 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~mem12;havoc main_#t~mem11;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-08 08:49:16,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2018-12-08 08:49:16,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:16,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2018-12-08 08:49:16,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2018-12-08 08:49:16,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:16,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:16,624 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-08 08:49:16,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:16,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:16,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:16,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:16,694 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-08 08:49:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:16,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-12-08 08:49:16,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:49:16,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-08 08:49:16,747 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. cyclomatic complexity: 14 Second operand 11 states. [2018-12-08 08:49:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:16,834 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-12-08 08:49:16,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 08:49:16,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 73 transitions. [2018-12-08 08:49:16,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:16,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 46 states and 50 transitions. [2018-12-08 08:49:16,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 08:49:16,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 08:49:16,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2018-12-08 08:49:16,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:16,835 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-08 08:49:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2018-12-08 08:49:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-08 08:49:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 08:49:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-08 08:49:16,836 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-08 08:49:16,836 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-08 08:49:16,836 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-08 08:49:16,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2018-12-08 08:49:16,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:16,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:16,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:16,837 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-08 08:49:16,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:16,837 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-08 08:49:16,837 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~mem12;havoc main_#t~mem11;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-08 08:49:16,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1199820568, now seen corresponding path program 4 times [2018-12-08 08:49:16,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:16,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2018-12-08 08:49:16,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:16,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327925, now seen corresponding path program 3 times [2018-12-08 08:49:16,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:16,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:21,206 WARN L180 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 285 DAG size of output: 213 [2018-12-08 08:49:21,342 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-08 08:49:21,344 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:21,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:21,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:21,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:21,344 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:21,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:21,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:21,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:21,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration16_Lasso [2018-12-08 08:49:21,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:21,344 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:21,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:21,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:21,351 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-08 08:49:21,352 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-08 08:49:21,353 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-08 08:49:21,354 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-08 08:49:21,355 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-08 08:49:21,356 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-08 08:49:21,357 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-08 08:49:21,357 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-08 08:49:21,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:21,652 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-08 08:49:21,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:21,655 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-08 08:49:21,656 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-08 08:49:21,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:21,658 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-08 08:49:21,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-08 08:49:21,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-08 08:49:21,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:21,850 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:21,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:21,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:21,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:21,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:21,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:21,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:21,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:21,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:21,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:21,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:21,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:21,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:21,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:21,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:21,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:21,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:21,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:21,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:21,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:21,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:21,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:21,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:21,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:21,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:21,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,863 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-08 08:49:21,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,863 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 08:49:21,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:21,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,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-08 08:49:21,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,871 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:21,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,871 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:21,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:21,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-08 08:49:21,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:21,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:21,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:21,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:21,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:21,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:21,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:21,887 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:49:21,887 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 08:49:21,887 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:21,887 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:21,888 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:21,888 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-08 08:49:21,950 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-12-08 08:49:21,950 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:49:21,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:21,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:21,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:21,982 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-08 08:49:21,982 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-08 08:49:21,982 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 08:49:21,989 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-08 08:49:21,989 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-08 08:49:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-08 08:49:21,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 42 letters. Loop has 2 letters. [2018-12-08 08:49:21,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:21,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 44 letters. Loop has 2 letters. [2018-12-08 08:49:21,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:21,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 42 letters. Loop has 4 letters. [2018-12-08 08:49:21,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:21,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 54 transitions. [2018-12-08 08:49:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:21,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 54 transitions. [2018-12-08 08:49:21,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-08 08:49:21,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-08 08:49:21,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 54 transitions. [2018-12-08 08:49:21,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:21,991 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-08 08:49:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 54 transitions. [2018-12-08 08:49:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-08 08:49:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-08 08:49:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-08 08:49:21,992 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-08 08:49:21,992 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-08 08:49:21,992 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-08 08:49:21,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2018-12-08 08:49:21,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:21,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:21,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:21,993 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-08 08:49:21,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:21,993 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~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3047#L41-2 [2018-12-08 08:49:21,993 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~mem12;havoc main_#t~mem11;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-08 08:49:21,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2018-12-08 08:49:21,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:21,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:22,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:22,007 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2018-12-08 08:49:22,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:22,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:22,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:22,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:22,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:22,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2018-12-08 08:49:22,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:22,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:22,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:24,206 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 310 DAG size of output: 230 [2018-12-08 08:49:24,313 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-08 08:49:24,315 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:24,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:24,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:24,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:24,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:24,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:24,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:24,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:24,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration17_Lasso [2018-12-08 08:49:24,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:24,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:24,317 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-08 08:49:24,318 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-08 08:49:24,318 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-08 08:49:24,319 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-08 08:49:24,322 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-08 08:49:24,323 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-08 08:49:24,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:24,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:24,325 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-08 08:49:24,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:24,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:24,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:24,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-08 08:49:24,601 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-08 08:49:24,601 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-08 08:49:24,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-08 08:49:24,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-08 08:49:24,606 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-08 08:49:24,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:24,950 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-08 08:49:24,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:24,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:24,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-08 08:49:24,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:24,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:24,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:24,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,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-08 08:49:24,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:24,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:24,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:24,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:24,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:24,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:24,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:24,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,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-08 08:49:24,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:24,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:24,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:24,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:24,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:24,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:24,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,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-08 08:49:24,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:24,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:24,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:24,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:24,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:24,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:24,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:24,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:24,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:24,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:24,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:24,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:24,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-08 08:49:24,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:24,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:24,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:24,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:24,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:24,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:24,973 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:24,980 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 08:49:24,980 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 08:49:24,980 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:24,980 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:24,980 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:24,980 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-08 08:49:25,029 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-12-08 08:49:25,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:25,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:25,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:25,068 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-08 08:49:25,068 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-08 08:49:25,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 08:49:25,078 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-08 08:49:25,078 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-08 08:49:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-08 08:49:25,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2018-12-08 08:49:25,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:25,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-08 08:49:25,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:25,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2018-12-08 08:49:25,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:25,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-12-08 08:49:25,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:25,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2018-12-08 08:49:25,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-08 08:49:25,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 08:49:25,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2018-12-08 08:49:25,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:25,080 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-08 08:49:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2018-12-08 08:49:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-08 08:49:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-08 08:49:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-12-08 08:49:25,082 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-08 08:49:25,082 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-08 08:49:25,082 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-08 08:49:25,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-12-08 08:49:25,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:25,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:25,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:25,083 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-08 08:49:25,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:25,083 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~mem12;havoc main_#t~mem11;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~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3406#L41-2 [2018-12-08 08:49:25,083 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~mem12;havoc main_#t~mem11;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-08 08:49:25,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,083 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2018-12-08 08:49:25,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 9 times [2018-12-08 08:49:25,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2018-12-08 08:49:25,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:25,151 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-08 08:49:25,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:25,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:25,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 08:49:25,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 08:49:25,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:49:25,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:25,203 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-08 08:49:25,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:25,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-08 08:49:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:49:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:49:25,249 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-08 08:49:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:25,340 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-12-08 08:49:25,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 08:49:25,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-12-08 08:49:25,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:25,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 55 states and 63 transitions. [2018-12-08 08:49:25,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-08 08:49:25,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 08:49:25,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-12-08 08:49:25,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:25,341 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-08 08:49:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-12-08 08:49:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-08 08:49:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-08 08:49:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-12-08 08:49:25,342 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-08 08:49:25,342 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-08 08:49:25,342 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-08 08:49:25,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-12-08 08:49:25,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:25,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:25,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:25,342 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-08 08:49:25,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:25,342 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~mem12;havoc main_#t~mem11;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~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3694#L41-2 [2018-12-08 08:49:25,343 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~mem12;havoc main_#t~mem11;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-08 08:49:25,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 356019245, now seen corresponding path program 4 times [2018-12-08 08:49:25,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 10 times [2018-12-08 08:49:25,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1462886640, now seen corresponding path program 4 times [2018-12-08 08:49:25,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:25,392 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-08 08:49:25,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:49:25,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2062ac5c-ed9a-409e-8f19-89c11ecfbad5/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-08 08:49:25,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 08:49:25,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 08:49:25,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:49:25,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:25,441 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-08 08:49:25,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:25,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-08 08:49:25,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:49:25,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-08 08:49:25,485 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-08 08:49:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:49:25,547 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-08 08:49:25,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 08:49:25,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 90 transitions. [2018-12-08 08:49:25,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:25,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 57 states and 65 transitions. [2018-12-08 08:49:25,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-08 08:49:25,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 08:49:25,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-08 08:49:25,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:25,548 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-08 08:49:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-08 08:49:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-08 08:49:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 08:49:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-08 08:49:25,549 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-08 08:49:25,549 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-08 08:49:25,549 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-08 08:49:25,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-12-08 08:49:25,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:49:25,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:25,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:25,550 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-08 08:49:25,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:25,550 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~mem12;havoc main_#t~mem11;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~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3997#L41-2 [2018-12-08 08:49:25,550 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~mem12;havoc main_#t~mem11;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-08 08:49:25,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 5 times [2018-12-08 08:49:25,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 11 times [2018-12-08 08:49:25,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 5 times [2018-12-08 08:49:25,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:25,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:25,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:25,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:28,835 WARN L180 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 358 DAG size of output: 271 [2018-12-08 08:49:29,075 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-12-08 08:49:29,077 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:29,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:29,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:29,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:29,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:29,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:29,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:29,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:29,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration20_Lasso [2018-12-08 08:49:29,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:29,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:29,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:29,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:29,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:29,086 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-08 08:49:29,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:29,088 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-08 08:49:29,090 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-08 08:49:29,090 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-08 08:49:29,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:29,092 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-08 08:49:29,093 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-08 08:49:29,094 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-08 08:49:29,095 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-08 08:49:29,096 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-08 08:49:29,540 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2018-12-08 08:49:29,592 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-08 08:49:29,593 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-08 08:49:29,594 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-08 08:49:29,594 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-08 08:49:29,596 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-08 08:49:29,708 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 08:49:30,461 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-12-08 08:49:30,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:30,468 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:30,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:30,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:30,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:30,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:30,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:30,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:30,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:30,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:30,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:30,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:30,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:30,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:30,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:30,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:30,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:30,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:30,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:30,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:30,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:30,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:30,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:30,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:30,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:30,511 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:49:30,511 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-08 08:49:30,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:30,512 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:30,512 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:30,512 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-08 08:49:30,631 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-08 08:49:30,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:49:30,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:30,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:30,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:30,669 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-08 08:49:30,670 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-08 08:49:30,670 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-08 08:49:30,677 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-08 08:49:30,677 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-08 08:49:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-08 08:49:30,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-08 08:49:30,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:30,678 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:49:30,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:30,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:30,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:30,716 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-08 08:49:30,717 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-08 08:49:30,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-08 08:49:30,724 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-08 08:49:30,724 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-08 08:49:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-08 08:49:30,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-08 08:49:30,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:30,725 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:49:30,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:30,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:30,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:30,777 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-08 08:49:30,777 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-08 08:49:30,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-08 08:49:30,784 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-08 08:49:30,784 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-08 08:49:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:49:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-12-08 08:49:30,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-08 08:49:30,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:30,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2018-12-08 08:49:30,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:30,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2018-12-08 08:49:30,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:30,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2018-12-08 08:49:30,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:49:30,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2018-12-08 08:49:30,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-08 08:49:30,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 08:49:30,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-12-08 08:49:30,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:30,786 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-08 08:49:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-12-08 08:49:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-12-08 08:49:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-08 08:49:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-08 08:49:30,787 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-08 08:49:30,787 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-08 08:49:30,787 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-08 08:49:30,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2018-12-08 08:49:30,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:49:30,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:30,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:30,787 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-08 08:49:30,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:30,787 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-08 08:49:30,787 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~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4876#L41-2 [2018-12-08 08:49:30,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 5 times [2018-12-08 08:49:30,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:30,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:30,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2018-12-08 08:49:30,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:30,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:30,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2018-12-08 08:49:30,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:30,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:30,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:30,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:49:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:35,643 WARN L180 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 309 DAG size of output: 232 [2018-12-08 08:49:35,769 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-08 08:49:35,771 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:35,771 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:35,771 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:35,771 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:35,771 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:35,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:35,771 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:35,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:35,771 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration21_Lasso [2018-12-08 08:49:35,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:35,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:35,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-08 08:49:35,774 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-08 08:49:35,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:35,776 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-08 08:49:35,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-08 08:49:35,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-08 08:49:35,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-08 08:49:35,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-08 08:49:35,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-08 08:49:35,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:36,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:36,205 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-08 08:49:36,206 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-08 08:49:36,207 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-08 08:49:36,207 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-08 08:49:36,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-08 08:49:36,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-08 08:49:36,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-08 08:49:36,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-08 08:49:36,418 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:36,418 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:36,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:36,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:36,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:36,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:36,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:36,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:36,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:36,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:36,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:36,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:36,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:36,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,427 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:36,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,427 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:36,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:36,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:36,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:36,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:36,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:36,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:36,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:36,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:36,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:36,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:36,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:36,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:36,446 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:49:36,446 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 08:49:36,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:36,447 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:36,447 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:36,447 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-08 08:49:36,557 INFO L297 tatePredicateManager]: 44 out of 46 supporting invariants were superfluous and have been removed [2018-12-08 08:49:36,560 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:49:36,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:36,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:36,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:36,610 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-08 08:49:36,610 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-08 08:49:36,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-08 08:49:36,639 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-08 08:49:36,639 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-08 08:49:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:49:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-08 08:49:36,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-08 08:49:36,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:36,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2018-12-08 08:49:36,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:36,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2018-12-08 08:49:36,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:36,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-12-08 08:49:36,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:49:36,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2018-12-08 08:49:36,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-08 08:49:36,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-08 08:49:36,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-08 08:49:36,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:49:36,641 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-08 08:49:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-08 08:49:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-12-08 08:49:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 08:49:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-12-08 08:49:36,642 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-08 08:49:36,642 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-08 08:49:36,642 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-08 08:49:36,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2018-12-08 08:49:36,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:49:36,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:49:36,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:49:36,643 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-08 08:49:36,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:49:36,643 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~mem12;havoc main_#t~mem11;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-08 08:49:36,643 INFO L796 eck$LassoCheckResult]: Loop: 5357#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;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-08 08:49:36,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 4 times [2018-12-08 08:49:36,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:36,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:36,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:36,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:36,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2018-12-08 08:49:36,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:36,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:36,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:36,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 6 times [2018-12-08 08:49:36,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:49:36,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:49:36,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:36,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:49:36,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:49:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:49:42,331 WARN L180 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 348 DAG size of output: 258 [2018-12-08 08:49:42,662 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-08 08:49:42,665 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:49:42,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:49:42,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:49:42,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:49:42,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:49:42,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:49:42,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:49:42,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:49:42,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration22_Lasso [2018-12-08 08:49:42,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:49:42,665 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:49:42,667 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-08 08:49:42,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:49:42,669 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-08 08:49:42,670 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-08 08:49:42,671 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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:42,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-08 08:49:43,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-08 08:49:43,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-08 08:49:43,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:49:43,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:49:43,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:43,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,521 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:43,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,523 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-12-08 08:49:43,524 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 08:49:43,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,526 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-12-08 08:49:43,526 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 08:49:43,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,559 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:49:43,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,560 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:49:43,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:49:43,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:49:43,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:49:43,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:49:43,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:49:43,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 08:49:43,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:49:43,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:49:43,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:49:43,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:49:43,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:49:43,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:49:43,575 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:49:43,584 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 08:49:43,584 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 08:49:43,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:49:43,585 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:49:43,585 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:49:43,585 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-08 08:49:43,715 INFO L297 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2018-12-08 08:49:43,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:49:43,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:49:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:43,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:49:43,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:49:43,770 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-08 08:49:43,770 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-08 08:49:43,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-08 08:49:43,803 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-08 08:49:43,803 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-08 08:49:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:49:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-08 08:49:43,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2018-12-08 08:49:43,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:43,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2018-12-08 08:49:43,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:43,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2018-12-08 08:49:43,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:49:43,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-12-08 08:49:43,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:49:43,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-12-08 08:49:43,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 08:49:43,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 08:49:43,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 08:49:43,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:49:43,804 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:49:43,804 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:49:43,804 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:49:43,804 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-08 08:49:43,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:49:43,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:49:43,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 08:49:43,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:49:43 BoogieIcfgContainer [2018-12-08 08:49:43,808 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 08:49:43,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:49:43,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:49:43,809 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:49:43,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:49:02" (3/4) ... [2018-12-08 08:49:43,811 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:49:43,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:49:43,812 INFO L168 Benchmark]: Toolchain (without parser) took 41848.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 122.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:49:43,812 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:49:43,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:49:43,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.38 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:49:43,813 INFO L168 Benchmark]: Boogie Preprocessor took 44.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-08 08:49:43,813 INFO L168 Benchmark]: RCFGBuilder took 179.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-12-08 08:49:43,814 INFO L168 Benchmark]: BuchiAutomizer took 41453.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.4 MB). Peak memory consumption was 140.6 MB. Max. memory is 11.5 GB. [2018-12-08 08:49:43,814 INFO L168 Benchmark]: Witness Printer took 2.62 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-08 08:49:43,816 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 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.38 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41453.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.4 MB). Peak memory consumption was 140.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.62 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 41.4s and 23 iterations. TraceHistogramMax:5. Analysis of lassos took 39.8s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. 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: 23ms 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...