./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/string_false-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_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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 77cd31699320cd40da64f32a92959020d19291bd ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:34:53,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:34:53,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:34:53,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:34:53,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:34:53,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:34:53,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:34:53,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:34:53,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:34:53,332 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:34:53,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:34:53,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:34:53,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:34:53,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:34:53,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:34:53,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:34:53,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:34:53,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:34:53,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:34:53,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:34:53,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:34:53,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:34:53,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:34:53,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:34:53,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:34:53,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:34:53,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:34:53,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:34:53,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:34:53,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:34:53,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:34:53,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:34:53,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:34:53,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:34:53,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:34:53,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:34:53,344 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 00:34:53,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:34:53,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:34:53,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:34:53,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:34:53,353 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:34:53,353 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 00:34:53,353 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 00:34:53,353 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 00:34:53,353 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 00:34:53,353 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 00:34:53,353 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 00:34:53,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:34:53,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:34:53,355 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 00:34:53,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:34:53,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 00:34:53,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:34:53,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:34:53,355 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 00:34:53,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:34:53,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:34:53,355 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 00:34:53,356 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 00:34:53,356 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_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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 -> 77cd31699320cd40da64f32a92959020d19291bd [2018-12-09 00:34:53,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:34:53,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:34:53,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:34:53,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:34:53,387 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:34:53,387 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-12-09 00:34:53,431 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/data/96a99f80d/bee06d70e0be4e8896be9a4168975517/FLAG7558c671c [2018-12-09 00:34:53,828 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:34:53,829 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-12-09 00:34:53,832 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/data/96a99f80d/bee06d70e0be4e8896be9a4168975517/FLAG7558c671c [2018-12-09 00:34:53,841 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/bin-2019/uautomizer/data/96a99f80d/bee06d70e0be4e8896be9a4168975517 [2018-12-09 00:34:53,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:34:53,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:34:53,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:34:53,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:34:53,846 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:34:53,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:53,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c57853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53, skipping insertion in model container [2018-12-09 00:34:53,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:53,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:34:53,863 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:34:53,953 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:34:53,955 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:34:53,969 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:34:53,980 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:34:53,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53 WrapperNode [2018-12-09 00:34:53,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:34:53,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:34:53,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:34:53,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:34:53,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:53,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:34:54,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:34:54,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:34:54,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:34:54,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... [2018-12-09 00:34:54,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:34:54,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:34:54,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:34:54,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:34:54,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:34:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:34:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:34:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:34:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:34:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:34:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:34:54,207 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:34:54,207 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-09 00:34:54,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:34:54 BoogieIcfgContainer [2018-12-09 00:34:54,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:34:54,208 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 00:34:54,208 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 00:34:54,211 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 00:34:54,211 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:34:54,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:34:53" (1/3) ... [2018-12-09 00:34:54,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18819efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:34:54, skipping insertion in model container [2018-12-09 00:34:54,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:34:54,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:34:53" (2/3) ... [2018-12-09 00:34:54,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18819efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:34:54, skipping insertion in model container [2018-12-09 00:34:54,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:34:54,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:34:54" (3/3) ... [2018-12-09 00:34:54,214 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-12-09 00:34:54,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:34:54,248 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 00:34:54,248 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 00:34:54,248 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 00:34:54,248 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:34:54,248 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:34:54,248 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 00:34:54,248 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:34:54,248 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 00:34:54,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-09 00:34:54,271 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-09 00:34:54,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:54,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:54,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 00:34:54,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:54,276 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 00:34:54,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-09 00:34:54,277 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-09 00:34:54,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:54,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:54,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 00:34:54,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:54,283 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#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; 22#L21-3true [2018-12-09 00:34:54,283 INFO L796 eck$LassoCheckResult]: Loop: 22#L21-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; 24#L21-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 22#L21-3true [2018-12-09 00:34:54,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 00:34:54,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:54,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-09 00:34:54,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:54,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:54,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:54,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-09 00:34:54,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:54,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,488 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:34:54,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:34:54,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:34:54,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:34:54,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:34:54,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:34:54,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:34:54,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:34:54,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-09 00:34:54,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:34:54,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:34:54,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:54,707 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:34:54,710 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:34:54,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:54,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:54,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:54,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:54,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,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-09 00:34:54,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:54,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:54,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:54,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,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-09 00:34:54,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,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-09 00:34:54,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,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-09 00:34:54,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:54,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:54,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:54,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,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-09 00:34:54,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:54,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:54,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:54,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-09 00:34:54,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:54,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:54,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:54,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:54,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:54,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:54,771 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:34:54,790 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 00:34:54,790 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 00:34:54,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:34:54,793 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:34:54,793 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:34:54,793 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-09 00:34:54,803 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 00:34:54,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:34:54,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:54,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:54,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:54,855 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-09 00:34:54,864 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-09 00:34:54,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-09 00:34:54,909 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-09 00:34:54,910 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-09 00:34:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:34:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-09 00:34:54,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-09 00:34:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:34:54,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-09 00:34:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:34:54,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 00:34:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:34:54,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2018-12-09 00:34:54,916 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:54,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2018-12-09 00:34:54,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 00:34:54,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 00:34:54,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-12-09 00:34:54,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:34:54,920 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-09 00:34:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-12-09 00:34:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-09 00:34:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 00:34:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-12-09 00:34:54,936 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-09 00:34:54,936 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-09 00:34:54,936 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 00:34:54,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-12-09 00:34:54,937 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:54,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:54,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:54,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 00:34:54,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:54,937 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#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; 134#L21-3 assume !(main_~i~0 < 5); 132#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 133#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 144#L25-3 [2018-12-09 00:34:54,937 INFO L796 eck$LassoCheckResult]: Loop: 144#L25-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; 145#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 144#L25-3 [2018-12-09 00:34:54,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-12-09 00:34:54,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:54,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:54,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:54,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:54,959 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-09 00:34:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:34:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:34:54,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:34:54,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:54,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-12-09 00:34:54,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:54,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:54,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:54,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:54,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:34:54,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:34:54,996 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-09 00:34:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:34:55,017 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-12-09 00:34:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:34:55,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-12-09 00:34:55,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2018-12-09 00:34:55,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-09 00:34:55,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-09 00:34:55,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-12-09 00:34:55,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:34:55,020 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-09 00:34:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-12-09 00:34:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-12-09 00:34:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 00:34:55,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-09 00:34:55,022 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-09 00:34:55,022 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-09 00:34:55,022 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 00:34:55,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-09 00:34:55,022 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:55,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:55,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:34:55,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:55,023 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#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; 183#L21-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; 184#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 185#L21-3 assume !(main_~i~0 < 5); 181#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 182#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 193#L25-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; 194#L25-2 [2018-12-09 00:34:55,023 INFO L796 eck$LassoCheckResult]: Loop: 194#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 195#L25-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; 194#L25-2 [2018-12-09 00:34:55,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2018-12-09 00:34:55,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:55,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:55,041 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-09 00:34:55,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:34:55,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:34:55,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:55,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:55,059 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-09 00:34:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:34:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-09 00:34:55,074 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:34:55,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2018-12-09 00:34:55,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:34:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:34:55,097 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-09 00:34:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:34:55,125 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-09 00:34:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:34:55,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-12-09 00:34:55,126 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 00:34:55,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-09 00:34:55,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-09 00:34:55,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-12-09 00:34:55,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:34:55,127 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 00:34:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-12-09 00:34:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-09 00:34:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 00:34:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-09 00:34:55,129 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-09 00:34:55,129 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-09 00:34:55,129 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 00:34:55,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-12-09 00:34:55,129 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:55,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:55,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 00:34:55,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:55,130 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 269#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; 262#L21-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; 263#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 264#L21-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; 265#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 277#L21-3 assume !(main_~i~0 < 5); 260#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 261#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 275#L25-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; 276#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 273#L25-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; 274#L25-2 [2018-12-09 00:34:55,130 INFO L796 eck$LassoCheckResult]: Loop: 274#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 278#L25-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; 274#L25-2 [2018-12-09 00:34:55,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2018-12-09 00:34:55,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:55,148 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-09 00:34:55,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:34:55,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:34:55,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:55,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:55,169 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-09 00:34:55,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:34:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 00:34:55,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:34:55,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2018-12-09 00:34:55,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:34:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:34:55,223 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-12-09 00:34:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:34:55,260 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 00:34:55,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:34:55,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-09 00:34:55,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-12-09 00:34:55,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-09 00:34:55,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 00:34:55,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-12-09 00:34:55,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:34:55,263 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-12-09 00:34:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-12-09 00:34:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-09 00:34:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 00:34:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-09 00:34:55,265 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-09 00:34:55,265 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-09 00:34:55,265 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 00:34:55,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-12-09 00:34:55,265 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:55,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:55,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-12-09 00:34:55,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:55,266 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#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; 364#L21-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; 365#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 368#L21-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; 383#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 366#L21-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; 367#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 381#L21-3 assume !(main_~i~0 < 5); 362#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 363#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 378#L25-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; 379#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 380#L25-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; 384#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 376#L25-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; 377#L25-2 [2018-12-09 00:34:55,266 INFO L796 eck$LassoCheckResult]: Loop: 377#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 382#L25-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; 377#L25-2 [2018-12-09 00:34:55,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2018-12-09 00:34:55,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:55,294 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-09 00:34:55,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:34:55,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:34:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:34:55,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:34:55,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:34:55,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:55,316 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-09 00:34:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:34:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-09 00:34:55,330 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:34:55,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2018-12-09 00:34:55,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:34:55,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:34:55,351 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-12-09 00:34:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:34:55,408 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-12-09 00:34:55,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:34:55,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2018-12-09 00:34:55,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2018-12-09 00:34:55,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-09 00:34:55,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-09 00:34:55,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-12-09 00:34:55,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:34:55,410 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-09 00:34:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-12-09 00:34:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-12-09 00:34:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 00:34:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-09 00:34:55,411 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-09 00:34:55,412 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-09 00:34:55,412 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 00:34:55,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-12-09 00:34:55,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:55,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:55,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-12-09 00:34:55,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:55,413 INFO L794 eck$LassoCheckResult]: Stem: 499#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#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; 489#L21-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; 490#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 491#L21-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; 492#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 509#L21-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; 508#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 507#L21-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; 504#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 503#L21-3 assume !(main_~i~0 < 5); 487#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 488#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 500#L25-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; 501#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 502#L25-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; 513#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 512#L25-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; 511#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 510#L25-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; 506#L25-2 [2018-12-09 00:34:55,413 INFO L796 eck$LassoCheckResult]: Loop: 506#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 505#L25-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; 506#L25-2 [2018-12-09 00:34:55,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2018-12-09 00:34:55,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:55,452 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-09 00:34:55,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:34:55,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:34:55,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:34:55,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 00:34:55,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:34:55,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:55,483 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-09 00:34:55,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:34:55,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 00:34:55,504 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:34:55,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2018-12-09 00:34:55,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:34:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:34:55,523 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-09 00:34:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:34:55,568 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-12-09 00:34:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:34:55,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-12-09 00:34:55,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-12-09 00:34:55,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-09 00:34:55,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-09 00:34:55,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-12-09 00:34:55,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:34:55,569 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-09 00:34:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-12-09 00:34:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-12-09 00:34:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 00:34:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 00:34:55,571 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 00:34:55,571 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 00:34:55,571 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 00:34:55,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-12-09 00:34:55,571 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:34:55,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:55,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:55,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-12-09 00:34:55,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:55,572 INFO L794 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 642#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; 635#L21-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; 636#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 637#L21-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; 638#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 660#L21-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; 658#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 656#L21-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; 655#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 652#L21-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; 651#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 650#L21-3 assume !(main_~i~0 < 5); 633#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 634#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 648#L25-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; 649#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 646#L25-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; 647#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 663#L25-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; 662#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 661#L25-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#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 657#L25-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; 654#L25-2 [2018-12-09 00:34:55,572 INFO L796 eck$LassoCheckResult]: Loop: 654#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 653#L25-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; 654#L25-2 [2018-12-09 00:34:55,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2018-12-09 00:34:55,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2018-12-09 00:34:55,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2018-12-09 00:34:55,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:55,734 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-09 00:34:55,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:34:55,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:34:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:34:55,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:34:55,753 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-09 00:34:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:34:55,803 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-09 00:34:55,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:34:55,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-12-09 00:34:55,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:34:55,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-12-09 00:34:55,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 00:34:55,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 00:34:55,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-12-09 00:34:55,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:34:55,805 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-09 00:34:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-12-09 00:34:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-09 00:34:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 00:34:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-09 00:34:55,807 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-09 00:34:55,808 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-09 00:34:55,808 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 00:34:55,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-12-09 00:34:55,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:34:55,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:55,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:55,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:34:55,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:55,809 INFO L794 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 731#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; 722#L21-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; 723#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 724#L21-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; 725#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 726#L21-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; 750#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 749#L21-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; 748#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 747#L21-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; 738#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 737#L21-3 assume !(main_~i~0 < 5); 720#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 721#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 734#L25-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; 735#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 736#L25-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; 746#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 745#L25-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; 744#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 743#L25-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; 742#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 741#L25-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; 740#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 739#L25-3 assume !(main_~i~0 < 5); 732#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 717#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 718#L30-3 [2018-12-09 00:34:55,810 INFO L796 eck$LassoCheckResult]: Loop: 718#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 719#L30-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; 718#L30-3 [2018-12-09 00:34:55,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2018-12-09 00:34:55,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:34:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2018-12-09 00:34:55,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2018-12-09 00:34:55,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:55,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:58,382 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-12-09 00:34:58,522 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-09 00:34:58,524 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:34:58,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:34:58,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:34:58,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:34:58,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:34:58,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:34:58,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:34:58,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:34:58,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-12-09 00:34:58,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:34:58,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:34:58,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,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-09 00:34:58,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-09 00:34:58,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-09 00:34:58,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-09 00:34:58,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-09 00:34:58,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-09 00:34:58,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:34:58,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:34:58,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:34:58,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,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-09 00:34:58,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,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-09 00:34:58,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,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-09 00:34:58,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,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-09 00:34:58,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,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-09 00:34:58,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,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-09 00:34:58,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,807 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:34:58,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,808 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:34:58,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,812 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:34:58,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,813 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:34:58,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:34:58,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:34:58,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:34:58,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:34:58,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:34:58,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:34:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:34:58,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:34:58,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:34:58,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:34:58,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:34:58,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:34:58,848 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-09 00:34:58,848 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 00:34:58,848 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:34:58,849 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:34:58,849 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:34:58,850 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-09 00:34:58,859 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 00:34:58,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:34:58,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:58,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:34:58,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:34:58,902 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-09 00:34:58,902 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-09 00:34:58,903 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 00:34:58,915 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-09 00:34:58,916 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-09 00:34:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:34:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-09 00:34:58,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2018-12-09 00:34:58,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:34:58,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2018-12-09 00:34:58,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:34:58,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 00:34:58,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:34:58,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-12-09 00:34:58,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 00:34:58,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-12-09 00:34:58,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-09 00:34:58,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 00:34:58,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-09 00:34:58,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:34:58,920 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-09 00:34:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-09 00:34:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 00:34:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 00:34:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-09 00:34:58,922 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-09 00:34:58,922 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-09 00:34:58,922 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 00:34:58,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-12-09 00:34:58,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 00:34:58,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:34:58,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:34:58,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:34:58,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:34:58,924 INFO L794 eck$LassoCheckResult]: Stem: 940#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 938#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; 930#L21-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; 931#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 932#L21-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; 933#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 958#L21-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; 957#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 956#L21-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; 955#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 954#L21-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; 951#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 950#L21-3 assume !(main_~i~0 < 5); 928#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 929#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 943#L25-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; 944#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 941#L25-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#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 953#L25-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; 952#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 949#L25-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; 948#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 947#L25-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; 946#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 945#L25-3 assume !(main_~i~0 < 5); 939#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 923#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 924#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 926#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 921#L30-4 main_~nc_B~0 := 0; 922#L34-3 [2018-12-09 00:34:58,924 INFO L796 eck$LassoCheckResult]: Loop: 922#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 937#L34-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; 922#L34-3 [2018-12-09 00:34:58,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2018-12-09 00:34:58,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:58,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:58,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2018-12-09 00:34:58,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:58,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:58,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:58,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:58,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:58,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:34:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2018-12-09 00:34:58,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:34:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:34:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:34:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:34:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:34:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:01,959 WARN L180 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 224 DAG size of output: 171 [2018-12-09 00:35:02,074 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 00:35:02,075 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:35:02,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:35:02,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:35:02,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:35:02,075 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:35:02,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:35:02,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:35:02,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:35:02,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-09 00:35:02,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:35:02,076 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:35:02,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:02,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-09 00:35:02,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:02,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:02,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,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-09 00:35:02,281 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:35:02,281 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:35:02,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:02,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:02,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:02,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:02,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:02,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:02,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:02,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:02,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:02,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:02,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:02,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:02,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:02,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:02,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:02,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:02,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:02,321 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:35:02,329 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 00:35:02,329 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 00:35:02,329 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:35:02,330 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:35:02,330 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:35:02,330 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-09 00:35:02,337 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 00:35:02,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:35:02,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:02,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:02,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:02,382 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-09 00:35:02,383 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-09 00:35:02,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 00:35:02,392 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-09 00:35:02,393 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-09 00:35:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-09 00:35:02,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2018-12-09 00:35:02,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:02,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2018-12-09 00:35:02,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:02,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2018-12-09 00:35:02,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:02,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-12-09 00:35:02,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:02,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2018-12-09 00:35:02,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-09 00:35:02,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 00:35:02,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-12-09 00:35:02,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:02,395 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-09 00:35:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-12-09 00:35:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 00:35:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:35:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-09 00:35:02,397 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-09 00:35:02,397 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-09 00:35:02,397 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 00:35:02,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-12-09 00:35:02,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:02,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:02,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:02,398 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-09 00:35:02,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:02,399 INFO L794 eck$LassoCheckResult]: Stem: 1158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1153#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; 1146#L21-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; 1147#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1148#L21-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; 1149#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1176#L21-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; 1175#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1174#L21-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; 1173#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1172#L21-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; 1169#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1168#L21-3 assume !(main_~i~0 < 5); 1144#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1145#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1161#L25-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; 1162#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1159#L25-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#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1171#L25-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; 1170#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1167#L25-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; 1166#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1165#L25-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; 1164#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1163#L25-3 assume !(main_~i~0 < 5); 1157#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1139#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1140#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1142#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1137#L30-4 main_~nc_B~0 := 0; 1138#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1155#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1150#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1151#L43-2 [2018-12-09 00:35:02,399 INFO L796 eck$LassoCheckResult]: Loop: 1151#L43-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); 1152#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1151#L43-2 [2018-12-09 00:35:02,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2018-12-09 00:35:02,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2018-12-09 00:35:02,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2018-12-09 00:35:02,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:02,455 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-09 00:35:02,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:35:02,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:35:02,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:35:02,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:35:02,494 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-09 00:35:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:02,501 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-09 00:35:02,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:35:02,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-12-09 00:35:02,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:02,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2018-12-09 00:35:02,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 00:35:02,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 00:35:02,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-12-09 00:35:02,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:02,503 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-09 00:35:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-12-09 00:35:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-09 00:35:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:35:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 00:35:02,504 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 00:35:02,505 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 00:35:02,505 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 00:35:02,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-12-09 00:35:02,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:02,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:02,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:02,506 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-09 00:35:02,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:02,506 INFO L794 eck$LassoCheckResult]: Stem: 1256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1254#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; 1244#L21-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; 1245#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1246#L21-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; 1247#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1274#L21-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; 1273#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1271#L21-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; 1269#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1267#L21-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#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1263#L21-3 assume !(main_~i~0 < 5); 1242#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1243#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1257#L25-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; 1258#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1259#L25-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#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1270#L25-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#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1266#L25-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; 1265#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1262#L25-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; 1261#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1260#L25-3 assume !(main_~i~0 < 5); 1255#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1241#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1237#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1238#L30-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; 1239#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1240#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1235#L30-4 main_~nc_B~0 := 0; 1236#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1252#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1248#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1249#L43-2 [2018-12-09 00:35:02,506 INFO L796 eck$LassoCheckResult]: Loop: 1249#L43-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); 1250#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1249#L43-2 [2018-12-09 00:35:02,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2018-12-09 00:35:02,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:02,542 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-09 00:35:02,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:02,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:35:02,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:02,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:02,577 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-09 00:35:02,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:35:02,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-12-09 00:35:02,592 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:35:02,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2018-12-09 00:35:02,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:35:02,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:35:02,633 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-09 00:35:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:02,662 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-09 00:35:02,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:35:02,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-12-09 00:35:02,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:02,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2018-12-09 00:35:02,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 00:35:02,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 00:35:02,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-12-09 00:35:02,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:02,663 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-09 00:35:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-12-09 00:35:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-09 00:35:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:35:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-09 00:35:02,664 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 00:35:02,664 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 00:35:02,665 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 00:35:02,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-12-09 00:35:02,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:02,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:02,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:02,665 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-09 00:35:02,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:02,665 INFO L794 eck$LassoCheckResult]: Stem: 1459#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1457#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; 1447#L21-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; 1448#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1449#L21-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; 1450#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1477#L21-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; 1476#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1474#L21-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; 1472#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1470#L21-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#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1465#L21-3 assume !(main_~i~0 < 5); 1445#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1446#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1460#L25-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; 1461#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1462#L25-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#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1473#L25-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#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1469#L25-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; 1468#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1467#L25-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; 1464#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1463#L25-3 assume !(main_~i~0 < 5); 1458#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1440#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1441#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1442#L30-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; 1443#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1444#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1438#L30-4 main_~nc_B~0 := 0; 1439#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1454#L34-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; 1455#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1456#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1451#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1452#L43-2 [2018-12-09 00:35:02,665 INFO L796 eck$LassoCheckResult]: Loop: 1452#L43-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); 1453#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1452#L43-2 [2018-12-09 00:35:02,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2018-12-09 00:35:02,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,680 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2018-12-09 00:35:02,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2018-12-09 00:35:02,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:05,440 WARN L180 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 261 DAG size of output: 199 [2018-12-09 00:35:05,589 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-09 00:35:05,591 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:35:05,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:35:05,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:35:05,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:35:05,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:35:05,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:35:05,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:35:05,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:35:05,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-09 00:35:05,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:35:05,591 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:35:05,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-09 00:35:05,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-09 00:35:05,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:05,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-09 00:35:05,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-09 00:35:05,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:05,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-09 00:35:05,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-09 00:35:05,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-09 00:35:05,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-09 00:35:05,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-09 00:35:05,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-09 00:35:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:05,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-09 00:35:05,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-09 00:35:05,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:05,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:05,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:06,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:35:06,063 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:35:06,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,084 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:06,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,084 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:06,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,089 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-09 00:35:06,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,090 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 00:35:06,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,097 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:06,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,097 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:06,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:06,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:06,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:06,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:06,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:06,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:06,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:06,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:06,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:06,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:06,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:06,112 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:35:06,129 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-12-09 00:35:06,129 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-12-09 00:35:06,129 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:35:06,130 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:35:06,130 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:35:06,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-09 00:35:06,166 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-12-09 00:35:06,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:35:06,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:06,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:06,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:06,212 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-09 00:35:06,212 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-09 00:35:06,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 00:35:06,220 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 50 transitions. Complement of second has 5 states. [2018-12-09 00:35:06,220 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-09 00:35:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-09 00:35:06,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2018-12-09 00:35:06,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:06,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-09 00:35:06,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:06,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2018-12-09 00:35:06,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:06,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2018-12-09 00:35:06,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:06,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2018-12-09 00:35:06,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 00:35:06,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 00:35:06,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2018-12-09 00:35:06,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:06,222 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-09 00:35:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2018-12-09 00:35:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 00:35:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 00:35:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-09 00:35:06,223 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-09 00:35:06,223 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-09 00:35:06,223 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 00:35:06,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-12-09 00:35:06,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:06,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:06,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:06,224 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-09 00:35:06,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:06,224 INFO L794 eck$LassoCheckResult]: Stem: 1744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1739#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; 1728#L21-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; 1729#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1730#L21-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; 1731#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1762#L21-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; 1761#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1760#L21-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; 1758#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1756#L21-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; 1751#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1750#L21-3 assume !(main_~i~0 < 5); 1726#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1727#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1745#L25-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; 1746#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1747#L25-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; 1759#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1757#L25-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; 1755#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1754#L25-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; 1753#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1752#L25-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; 1749#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1748#L25-3 assume !(main_~i~0 < 5); 1743#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1721#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1722#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1723#L30-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; 1724#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1725#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1719#L30-4 main_~nc_B~0 := 0; 1720#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1740#L34-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; 1741#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1742#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1732#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1733#L43-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); 1737#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 1734#L43-2 [2018-12-09 00:35:06,224 INFO L796 eck$LassoCheckResult]: Loop: 1734#L43-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); 1735#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1734#L43-2 [2018-12-09 00:35:06,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2018-12-09 00:35:06,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:06,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2018-12-09 00:35:06,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2018-12-09 00:35:06,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:06,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:06,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:06,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:06,278 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-09 00:35:06,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:06,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:35:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:06,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:06,338 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-09 00:35:06,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:35:06,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-12-09 00:35:06,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:35:06,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:35:06,391 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-12-09 00:35:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:06,492 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-12-09 00:35:06,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:35:06,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-12-09 00:35:06,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:06,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2018-12-09 00:35:06,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 00:35:06,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 00:35:06,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2018-12-09 00:35:06,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:06,493 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-09 00:35:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2018-12-09 00:35:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-12-09 00:35:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 00:35:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-09 00:35:06,495 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-09 00:35:06,495 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-09 00:35:06,495 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 00:35:06,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2018-12-09 00:35:06,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:06,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:06,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:06,496 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-09 00:35:06,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:06,497 INFO L794 eck$LassoCheckResult]: Stem: 2014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2012#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; 1997#L21-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; 1998#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1999#L21-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; 2000#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2033#L21-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; 2031#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2030#L21-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; 2029#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2027#L21-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; 2025#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2024#L21-3 assume !(main_~i~0 < 5); 1995#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1996#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2015#L25-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; 2016#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2018#L25-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; 2035#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2034#L25-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; 2032#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2028#L25-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; 2026#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2023#L25-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; 2022#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2021#L25-3 assume !(main_~i~0 < 5); 2013#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1990#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1991#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1992#L30-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; 1993#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1994#L30-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; 2019#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2001#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1988#L30-4 main_~nc_B~0 := 0; 1989#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2009#L34-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; 2010#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2011#L34-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; 2020#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2017#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2002#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2003#L43-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); 2007#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2004#L43-2 [2018-12-09 00:35:06,497 INFO L796 eck$LassoCheckResult]: Loop: 2004#L43-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); 2005#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2004#L43-2 [2018-12-09 00:35:06,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2018-12-09 00:35:06,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:06,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2018-12-09 00:35:06,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2018-12-09 00:35:06,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:06,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:06,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:06,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:08,803 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 310 DAG size of output: 231 [2018-12-09 00:35:08,961 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-09 00:35:08,963 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:35:08,963 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:35:08,963 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:35:08,963 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:35:08,963 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:35:08,963 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:35:08,963 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:35:08,963 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:35:08,963 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration14_Lasso [2018-12-09 00:35:08,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:35:08,963 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:35:08,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-09 00:35:08,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:08,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:09,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:09,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:09,603 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-09 00:35:09,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:35:09,652 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:35:09,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,671 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-09 00:35:09,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,673 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-12-09 00:35:09,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,687 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:09,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,688 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:09,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,691 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:09,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,692 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:09,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,698 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:09,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:09,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:09,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:09,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:09,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:09,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:09,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:09,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:09,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:09,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:09,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:09,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:09,714 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:35:09,728 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 00:35:09,728 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-09 00:35:09,728 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:35:09,729 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:35:09,729 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:35:09,729 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-09 00:35:09,791 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2018-12-09 00:35:09,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:09,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:09,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:09,827 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-09 00:35:09,827 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-09 00:35:09,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 00:35:09,834 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-09 00:35:09,834 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-09 00:35:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-09 00:35:09,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2018-12-09 00:35:09,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:09,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-09 00:35:09,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:09,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2018-12-09 00:35:09,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:09,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-12-09 00:35:09,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:09,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2018-12-09 00:35:09,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-09 00:35:09,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 00:35:09,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2018-12-09 00:35:09,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:09,836 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-09 00:35:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2018-12-09 00:35:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-09 00:35:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 00:35:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-12-09 00:35:09,837 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-09 00:35:09,837 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-09 00:35:09,837 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 00:35:09,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-12-09 00:35:09,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:09,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:09,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:09,838 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-09 00:35:09,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:09,838 INFO L794 eck$LassoCheckResult]: Stem: 2377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2375#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; 2360#L21-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; 2361#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2362#L21-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; 2363#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2399#L21-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; 2398#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2397#L21-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; 2396#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2394#L21-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; 2390#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2389#L21-3 assume !(main_~i~0 < 5); 2358#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2359#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2379#L25-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; 2380#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2382#L25-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; 2395#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2393#L25-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; 2392#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2391#L25-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; 2388#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2387#L25-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; 2386#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2385#L25-3 assume !(main_~i~0 < 5); 2376#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2353#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2354#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2355#L30-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; 2356#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2357#L30-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; 2383#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2364#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2351#L30-4 main_~nc_B~0 := 0; 2352#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2372#L34-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; 2373#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2374#L34-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; 2384#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2381#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2365#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2366#L43-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); 2370#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2378#L43-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); 2400#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2367#L43-2 [2018-12-09 00:35:09,838 INFO L796 eck$LassoCheckResult]: Loop: 2367#L43-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); 2368#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2367#L43-2 [2018-12-09 00:35:09,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:09,838 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2018-12-09 00:35:09,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:09,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:09,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:09,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:09,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2018-12-09 00:35:09,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:09,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:09,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:09,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:09,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2018-12-09 00:35:09,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:09,888 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-09 00:35:09,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:09,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:35:09,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:35:09,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:35:09,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:35:09,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:09,947 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-09 00:35:09,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:35:09,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-09 00:35:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:35:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:35:09,996 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-09 00:35:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:10,099 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-12-09 00:35:10,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:35:10,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-12-09 00:35:10,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:10,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 55 states and 63 transitions. [2018-12-09 00:35:10,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-09 00:35:10,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 00:35:10,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-12-09 00:35:10,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:10,100 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-09 00:35:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-12-09 00:35:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-09 00:35:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 00:35:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-12-09 00:35:10,102 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-09 00:35:10,102 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-09 00:35:10,102 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-09 00:35:10,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-12-09 00:35:10,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:10,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:10,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:10,102 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-09 00:35:10,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:10,103 INFO L794 eck$LassoCheckResult]: Stem: 2665#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2660#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; 2648#L21-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; 2649#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2650#L21-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; 2651#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2688#L21-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; 2687#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2686#L21-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; 2685#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2684#L21-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; 2681#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2680#L21-3 assume !(main_~i~0 < 5); 2646#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2647#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2667#L25-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; 2668#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2671#L25-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; 2683#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2682#L25-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; 2679#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2678#L25-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; 2677#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2675#L25-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; 2674#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2673#L25-3 assume !(main_~i~0 < 5); 2664#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2641#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2642#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2643#L30-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; 2644#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2645#L30-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; 2672#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2652#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2639#L30-4 main_~nc_B~0 := 0; 2640#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2661#L34-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; 2670#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2689#L34-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; 2662#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2663#L34-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; 2676#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2669#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2653#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2654#L43-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); 2658#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2666#L43-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); 2690#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2655#L43-2 [2018-12-09 00:35:10,103 INFO L796 eck$LassoCheckResult]: Loop: 2655#L43-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); 2656#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2655#L43-2 [2018-12-09 00:35:10,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash 356019245, now seen corresponding path program 4 times [2018-12-09 00:35:10,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:10,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2018-12-09 00:35:10,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:10,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1462886640, now seen corresponding path program 4 times [2018-12-09 00:35:10,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:10,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:10,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:10,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:10,160 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-09 00:35:10,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:35:10,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67edab9a-5814-4a3d-a3e9-dff23f2c7ec3/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-09 00:35:10,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:35:10,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:35:10,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:35:10,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:10,242 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-09 00:35:10,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:35:10,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-09 00:35:10,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:35:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:35:10,284 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-09 00:35:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:35:10,343 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-09 00:35:10,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:35:10,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 90 transitions. [2018-12-09 00:35:10,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:10,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 57 states and 65 transitions. [2018-12-09 00:35:10,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-09 00:35:10,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 00:35:10,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-09 00:35:10,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:10,345 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-09 00:35:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-09 00:35:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-09 00:35:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 00:35:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-09 00:35:10,346 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-09 00:35:10,347 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-09 00:35:10,347 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-09 00:35:10,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-12-09 00:35:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:35:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:10,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:10,347 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-09 00:35:10,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:10,348 INFO L794 eck$LassoCheckResult]: Stem: 2969#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2964#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; 2951#L21-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; 2952#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2953#L21-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; 2954#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2956#L21-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; 2991#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2990#L21-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; 2988#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2985#L21-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; 2980#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2979#L21-3 assume !(main_~i~0 < 5); 2949#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2950#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2970#L25-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; 2971#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2973#L25-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; 2992#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2989#L25-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; 2987#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2984#L25-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; 2983#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2978#L25-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; 2977#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2976#L25-3 assume !(main_~i~0 < 5); 2968#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2944#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2945#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2946#L30-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; 2947#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2948#L30-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; 2993#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2975#L30-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; 2974#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2955#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2942#L30-4 main_~nc_B~0 := 0; 2943#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2965#L34-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; 2966#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2967#L34-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; 2986#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2982#L34-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; 2981#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2972#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2957#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2958#L43-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); 2995#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2994#L43-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); 2962#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2959#L43-2 [2018-12-09 00:35:10,348 INFO L796 eck$LassoCheckResult]: Loop: 2959#L43-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); 2960#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2959#L43-2 [2018-12-09 00:35:10,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 5 times [2018-12-09 00:35:10,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:10,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,384 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2018-12-09 00:35:10,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:10,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 5 times [2018-12-09 00:35:10,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:10,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:12,755 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 358 DAG size of output: 267 [2018-12-09 00:35:12,903 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-09 00:35:12,905 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:35:12,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:35:12,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:35:12,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:35:12,905 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:35:12,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:35:12,905 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:35:12,905 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:35:12,905 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration17_Lasso [2018-12-09 00:35:12,905 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:35:12,905 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:35:12,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:12,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:13,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:13,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:13,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:13,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:13,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:13,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:13,414 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 00:35:14,352 WARN L180 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-12-09 00:35:14,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:35:14,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:35:14,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-09 00:35:14,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:14,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:14,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,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-09 00:35:14,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:14,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:14,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:14,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:14,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,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-09 00:35:14,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,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-09 00:35:14,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:14,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:14,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:14,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:14,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,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-09 00:35:14,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:14,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:14,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,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-09 00:35:14,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:14,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:14,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:14,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-09 00:35:14,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:14,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:14,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:14,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:14,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:14,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:14,408 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:35:14,419 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 00:35:14,420 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 00:35:14,420 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:35:14,420 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:35:14,421 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:35:14,421 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~nc_B~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-12-09 00:35:14,529 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-09 00:35:14,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:14,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:14,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:14,561 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-09 00:35:14,561 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-09 00:35:14,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-09 00:35:14,568 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-09 00:35:14,568 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-09 00:35:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-09 00:35:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-09 00:35:14,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:14,569 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:35:14,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:14,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:14,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:14,602 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-09 00:35:14,602 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-09 00:35:14,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-09 00:35:14,607 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-09 00:35:14,607 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-09 00:35:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-09 00:35:14,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-09 00:35:14,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:14,608 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:35:14,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:14,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:14,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:14,639 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-09 00:35:14,639 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-09 00:35:14,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-09 00:35:14,645 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-09 00:35:14,646 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-09 00:35:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-12-09 00:35:14,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-09 00:35:14,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:14,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2018-12-09 00:35:14,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:14,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2018-12-09 00:35:14,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:14,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2018-12-09 00:35:14,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:35:14,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2018-12-09 00:35:14,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 00:35:14,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 00:35:14,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-12-09 00:35:14,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:14,648 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-09 00:35:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-12-09 00:35:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-12-09 00:35:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 00:35:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-09 00:35:14,649 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-09 00:35:14,649 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-09 00:35:14,649 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-09 00:35:14,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2018-12-09 00:35:14,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:35:14,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:14,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:14,649 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-09 00:35:14,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:14,650 INFO L794 eck$LassoCheckResult]: Stem: 3862#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3857#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; 3847#L21-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; 3848#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3849#L21-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; 3850#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3887#L21-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; 3886#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3885#L21-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; 3884#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3883#L21-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; 3882#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3881#L21-3 assume !(main_~i~0 < 5); 3845#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3846#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3863#L25-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; 3864#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3866#L25-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; 3880#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3878#L25-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; 3877#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3874#L25-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; 3873#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3872#L25-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; 3870#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3869#L25-3 assume !(main_~i~0 < 5); 3861#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3840#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3841#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3842#L30-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; 3843#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3844#L30-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; 3871#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3868#L30-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; 3867#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3851#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3838#L30-4 main_~nc_B~0 := 0; 3839#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3858#L34-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; 3859#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3860#L34-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; 3879#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3876#L34-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; 3875#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3865#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3852#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3853#L43-2 [2018-12-09 00:35:14,650 INFO L796 eck$LassoCheckResult]: Loop: 3853#L43-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); 3854#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3853#L43-2 [2018-12-09 00:35:14,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:14,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2018-12-09 00:35:14,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:14,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:14,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:14,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2018-12-09 00:35:14,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:14,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:14,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2018-12-09 00:35:14,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:14,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:35:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:18,889 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 309 DAG size of output: 234 [2018-12-09 00:35:19,163 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-12-09 00:35:19,166 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:35:19,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:35:19,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:35:19,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:35:19,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:35:19,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:35:19,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:35:19,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:35:19,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration18_Lasso [2018-12-09 00:35:19,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:35:19,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:35:19,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,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-09 00:35:19,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-09 00:35:19,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-09 00:35:19,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-09 00:35:19,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-09 00:35:19,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-09 00:35:19,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,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-09 00:35:19,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-09 00:35:19,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,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-09 00:35:19,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-09 00:35:19,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:19,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-09 00:35:19,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:35:19,883 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:35:19,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-09 00:35:19,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,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-09 00:35:19,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,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-09 00:35:19,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:19,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:19,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:19,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,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-09 00:35:19,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,895 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:19,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:19,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,898 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:19,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,899 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:19,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,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-09 00:35:19,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,901 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:19,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,902 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:19,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,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-09 00:35:19,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,905 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-09 00:35:19,905 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:35:19,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,908 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-12-09 00:35:19,908 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 00:35:19,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,919 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:19,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,919 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:19,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,921 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:19,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:19,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,928 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:19,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,929 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:19,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:19,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:19,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:19,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:19,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:19,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:19,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:19,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:19,948 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:35:19,964 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 00:35:19,964 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-12-09 00:35:19,965 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:35:19,965 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:35:19,965 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:35:19,965 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-09 00:35:20,122 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-12-09 00:35:20,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:20,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:20,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:20,160 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-09 00:35:20,160 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-09 00:35:20,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 00:35:20,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 59 states and 69 transitions. Complement of second has 6 states. [2018-12-09 00:35:20,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-09 00:35:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-09 00:35:20,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-09 00:35:20,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:20,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2018-12-09 00:35:20,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:20,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2018-12-09 00:35:20,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:20,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-12-09 00:35:20,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:35:20,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2018-12-09 00:35:20,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 00:35:20,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 00:35:20,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-09 00:35:20,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:35:20,180 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-09 00:35:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-09 00:35:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-12-09 00:35:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 00:35:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-12-09 00:35:20,181 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-09 00:35:20,181 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-09 00:35:20,181 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-09 00:35:20,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2018-12-09 00:35:20,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:35:20,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:35:20,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:35:20,182 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-09 00:35:20,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:35:20,182 INFO L794 eck$LassoCheckResult]: Stem: 4330#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4325#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; 4315#L21-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; 4316#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4317#L21-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; 4318#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4358#L21-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; 4357#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4356#L21-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; 4355#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4354#L21-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; 4353#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4352#L21-3 assume !(main_~i~0 < 5); 4313#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4314#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4334#L25-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; 4335#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4337#L25-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; 4351#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4349#L25-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; 4348#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4345#L25-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; 4344#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4343#L25-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; 4341#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4340#L25-3 assume !(main_~i~0 < 5); 4329#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4308#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4309#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4310#L30-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; 4311#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4312#L30-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; 4342#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4339#L30-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; 4338#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4319#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4306#L30-4 main_~nc_B~0 := 0; 4307#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4326#L34-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; 4327#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4328#L34-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; 4350#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4347#L34-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; 4346#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4336#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4320#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4321#L43-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); 4323#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 4333#L43-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); 4331#L43 [2018-12-09 00:35:20,183 INFO L796 eck$LassoCheckResult]: Loop: 4331#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4332#L43-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); 4331#L43 [2018-12-09 00:35:20,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2018-12-09 00:35:20,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:20,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:20,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:20,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:20,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:20,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2018-12-09 00:35:20,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:20,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:20,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:20,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:20,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:20,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 6 times [2018-12-09 00:35:20,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:35:20,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:35:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:20,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:35:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:35:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:35:23,227 WARN L180 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 348 DAG size of output: 255 [2018-12-09 00:35:23,354 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-09 00:35:23,356 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:35:23,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:35:23,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:35:23,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:35:23,356 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:35:23,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:35:23,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:35:23,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:35:23,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration19_Lasso [2018-12-09 00:35:23,356 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:35:23,356 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:35:23,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,757 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-12-09 00:35:23,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:23,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:35:24,154 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 00:35:24,226 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:35:24,226 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:35:24,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:24,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:24,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:24,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:24,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:24,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:24,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:24,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:24,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:24,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:35:24,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:35:24,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:35:24,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,238 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-12-09 00:35:24,239 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:35:24,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,243 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-12-09 00:35:24,243 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 00:35:24,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,275 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:24,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,276 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:24,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,277 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:24,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,278 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:24,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,285 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:35:24,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,286 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:35:24,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:35:24,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:35:24,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:35:24,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:35:24,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:35:24,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:35:24,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:35:24,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:35:24,297 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:35:24,303 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 00:35:24,303 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:35:24,304 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:35:24,304 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:35:24,304 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:35:24,304 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0) = 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-12-09 00:35:24,432 INFO L297 tatePredicateManager]: 46 out of 46 supporting invariants were superfluous and have been removed [2018-12-09 00:35:24,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:35:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:24,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:35:24,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:35:24,464 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-09 00:35:24,464 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-09 00:35:24,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-09 00:35:24,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 66 states and 77 transitions. Complement of second has 6 states. [2018-12-09 00:35:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 00:35:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:35:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-09 00:35:24,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2018-12-09 00:35:24,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:24,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2018-12-09 00:35:24,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:24,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2018-12-09 00:35:24,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:35:24,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-12-09 00:35:24,476 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:35:24,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-12-09 00:35:24,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 00:35:24,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 00:35:24,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 00:35:24,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:35:24,476 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:35:24,476 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:35:24,476 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:35:24,476 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-09 00:35:24,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:35:24,477 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:35:24,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 00:35:24,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:35:24 BoogieIcfgContainer [2018-12-09 00:35:24,481 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 00:35:24,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:35:24,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:35:24,481 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:35:24,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:34:54" (3/4) ... [2018-12-09 00:35:24,484 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:35:24,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:35:24,485 INFO L168 Benchmark]: Toolchain (without parser) took 30641.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.9 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -215.7 MB). Peak memory consumption was 267.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:24,485 INFO L168 Benchmark]: CDTParser took 0.16 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-09 00:35:24,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.31 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:24,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.39 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:24,486 INFO L168 Benchmark]: Boogie Preprocessor took 46.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:24,486 INFO L168 Benchmark]: RCFGBuilder took 158.93 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:24,486 INFO L168 Benchmark]: BuchiAutomizer took 30273.20 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.1 MB). Peak memory consumption was 282.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:35:24,487 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 225.4 kB). Peak memory consumption was 225.4 kB. Max. memory is 11.5 GB. [2018-12-09 00:35:24,489 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.31 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.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 21.39 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.93 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30273.20 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.1 MB). Peak memory consumption was 282.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 225.4 kB). Peak memory consumption was 225.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (11 trivial, 7 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 unknown-#length-unknown[string_A] + -1 * string_A + -1 * i 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 + nc_A and consists of 4 locations. One deterministic module has affine ranking function j + -1 * i + nc_A and consists of 4 locations. One nondeterministic module has affine ranking function nc_B + -1 * j and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.2s and 20 iterations. TraceHistogramMax:5. Analysis of lassos took 29.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 58 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 16. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 369 SDtfs, 364 SDslu, 465 SDs, 0 SdLazy, 719 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU6 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital313 mio100 ax100 hnf99 lsp96 ukn44 mio100 lsp57 div100 bol100 ite100 ukn100 eq171 hnf84 smp94 dnf366 smp88 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 8 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...