./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_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:18,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 09:58:18,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 09:58:18,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 09:58:18,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 09:58:18,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 09:58:18,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 09:58:18,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 09:58:18,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 09:58:18,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 09:58:18,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 09:58:18,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 09:58:18,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 09:58:18,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 09:58:18,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 09:58:18,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 09:58:18,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 09:58:18,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 09:58:18,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 09:58:18,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 09:58:18,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 09:58:18,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 09:58:18,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 09:58:18,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 09:58:18,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 09:58:18,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 09:58:18,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 09:58:18,755 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 09:58:18,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 09:58:18,756 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 09:58:18,756 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 09:58:18,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 09:58:18,756 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 09:58:18,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 09:58:18,757 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 09:58:18,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 09:58:18,758 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 09:58:18,765 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 09:58:18,765 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 09:58:18,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 09:58:18,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 09:58:18,766 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 09:58:18,766 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 09:58:18,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 09:58:18,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 09:58:18,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 09:58:18,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 09:58:18,769 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 09:58:18,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 09:58:18,769 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 09:58:18,769 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 09:58:18,769 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 09:58:18,769 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_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:18,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 09:58:18,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 09:58:18,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 09:58:18,801 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 09:58:18,801 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 09:58:18,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-12-01 09:58:18,838 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/data/2851a47be/1eff5ce8e710467f9624f009fb10f7b7/FLAG6bfe0567f [2018-12-01 09:58:19,215 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 09:58:19,215 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-12-01 09:58:19,218 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/data/2851a47be/1eff5ce8e710467f9624f009fb10f7b7/FLAG6bfe0567f [2018-12-01 09:58:19,582 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/bin-2019/uautomizer/data/2851a47be/1eff5ce8e710467f9624f009fb10f7b7 [2018-12-01 09:58:19,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 09:58:19,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 09:58:19,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 09:58:19,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 09:58:19,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 09:58:19,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6357a878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19, skipping insertion in model container [2018-12-01 09:58:19,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 09:58:19,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 09:58:19,717 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 09:58:19,720 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 09:58:19,733 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 09:58:19,744 INFO L195 MainTranslator]: Completed translation [2018-12-01 09:58:19,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19 WrapperNode [2018-12-01 09:58:19,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 09:58:19,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 09:58:19,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 09:58:19,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 09:58:19,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 09:58:19,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 09:58:19,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 09:58:19,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 09:58:19,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... [2018-12-01 09:58:19,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 09:58:19,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 09:58:19,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 09:58:19,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 09:58:19,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 09:58:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 09:58:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 09:58:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 09:58:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 09:58:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 09:58:19,990 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 09:58:19,991 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-01 09:58:19,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:58:19 BoogieIcfgContainer [2018-12-01 09:58:19,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 09:58:19,992 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 09:58:19,992 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 09:58:19,995 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 09:58:19,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 09:58:19,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 09:58:19" (1/3) ... [2018-12-01 09:58:19,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e6c7083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 09:58:19, skipping insertion in model container [2018-12-01 09:58:19,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 09:58:19,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:58:19" (2/3) ... [2018-12-01 09:58:19,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e6c7083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 09:58:19, skipping insertion in model container [2018-12-01 09:58:19,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 09:58:19,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:58:19" (3/3) ... [2018-12-01 09:58:19,999 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-12-01 09:58:20,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 09:58:20,041 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 09:58:20,041 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 09:58:20,041 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 09:58:20,041 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 09:58:20,041 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 09:58:20,041 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 09:58:20,041 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 09:58:20,041 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 09:58:20,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-01 09:58:20,068 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-01 09:58:20,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:20,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:20,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 09:58:20,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:20,073 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 09:58:20,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-01 09:58:20,074 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-01 09:58:20,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:20,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:20,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 09:58:20,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:20,079 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-01 09:58:20,079 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-01 09:58:20,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 09:58:20,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-01 09:58:20,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-01 09:58:20,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,290 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:20,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:20,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:20,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:20,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:20,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:20,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:20,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:20,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-01 09:58:20,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:20,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:20,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,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-01 09:58:20,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-01 09:58:20,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-01 09:58:20,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-01 09:58:20,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:20,511 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:20,514 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:20,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:20,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:20,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:20,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:20,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:20,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:20,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:20,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:20,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:20,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:20,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:20,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:20,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:20,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:20,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:20,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:20,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:20,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:20,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:20,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:20,602 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-01 09:58:20,603 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 09:58:20,604 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:20,605 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:20,605 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:20,606 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-01 09:58:20,615 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 09:58:20,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 09:58:20,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:20,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:20,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:20,662 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-01 09:58:20,671 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-01 09:58:20,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-01 09:58:20,711 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-01 09:58:20,711 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-01 09:58:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-12-01 09:58:20,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-01 09:58:20,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:20,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 09:58:20,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:20,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-01 09:58:20,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:20,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2018-12-01 09:58:20,718 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:20,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2018-12-01 09:58:20,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 09:58:20,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-01 09:58:20,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-12-01 09:58:20,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:20,722 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-01 09:58:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-12-01 09:58:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-01 09:58:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-01 09:58:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-12-01 09:58:20,740 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-01 09:58:20,740 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-01 09:58:20,740 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 09:58:20,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-12-01 09:58:20,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:20,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:20,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:20,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 09:58:20,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:20,742 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-01 09:58:20,742 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-01 09:58:20,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,742 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-12-01 09:58:20,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:20,767 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-01 09:58:20,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:58:20,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:58:20,770 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 09:58:20,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-12-01 09:58:20,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:58:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:58:20,807 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-01 09:58:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:20,827 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-12-01 09:58:20,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:58:20,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-12-01 09:58:20,828 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:20,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2018-12-01 09:58:20,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-01 09:58:20,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-01 09:58:20,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-12-01 09:58:20,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:20,831 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-12-01 09:58:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-12-01 09:58:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-12-01 09:58:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 09:58:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-01 09:58:20,833 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-01 09:58:20,833 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-01 09:58:20,833 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 09:58:20,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-01 09:58:20,834 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:20,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:20,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:20,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:58:20,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:20,834 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-01 09:58:20,835 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-01 09:58:20,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,835 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2018-12-01 09:58:20,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:20,853 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-01 09:58:20,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:20,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:20,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:20,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:20,872 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-01 09:58:20,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 09:58:20,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-01 09:58:20,887 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 09:58:20,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2018-12-01 09:58:20,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 09:58:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 09:58:20,916 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-01 09:58:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:20,944 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-01 09:58:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 09:58:20,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-12-01 09:58:20,945 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:20,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-12-01 09:58:20,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-01 09:58:20,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-01 09:58:20,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-12-01 09:58:20,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:20,946 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-01 09:58:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-12-01 09:58:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-01 09:58:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-01 09:58:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-12-01 09:58:20,947 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-01 09:58:20,948 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-12-01 09:58:20,948 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 09:58:20,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-12-01 09:58:20,948 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:20,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:20,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:20,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-01 09:58:20,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:20,949 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-01 09:58:20,949 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-01 09:58:20,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2018-12-01 09:58:20,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:20,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:20,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:20,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:20,968 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-01 09:58:20,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:20,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:20,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:20,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:20,993 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-01 09:58:21,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 09:58:21,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-01 09:58:21,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 09:58:21,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2018-12-01 09:58:21,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 09:58:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 09:58:21,043 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-12-01 09:58:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:21,088 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-01 09:58:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 09:58:21,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-01 09:58:21,089 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:21,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-12-01 09:58:21,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-01 09:58:21,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-01 09:58:21,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-12-01 09:58:21,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:21,089 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-12-01 09:58:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-12-01 09:58:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-01 09:58:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-01 09:58:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-01 09:58:21,091 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-01 09:58:21,091 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-01 09:58:21,091 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 09:58:21,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-12-01 09:58:21,091 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:21,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:21,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:21,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-12-01 09:58:21,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:21,092 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-01 09:58:21,092 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-01 09:58:21,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2018-12-01 09:58:21,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:21,117 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-01 09:58:21,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:21,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:21,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 09:58:21,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 09:58:21,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 09:58:21,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:21,146 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-01 09:58:21,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 09:58:21,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-01 09:58:21,160 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 09:58:21,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2018-12-01 09:58:21,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 09:58:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-01 09:58:21,189 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-12-01 09:58:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:21,243 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-12-01 09:58:21,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 09:58:21,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2018-12-01 09:58:21,244 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:21,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2018-12-01 09:58:21,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-01 09:58:21,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-12-01 09:58:21,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-12-01 09:58:21,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:21,246 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-01 09:58:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-12-01 09:58:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-12-01 09:58:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 09:58:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-01 09:58:21,247 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-01 09:58:21,247 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-01 09:58:21,248 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 09:58:21,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-12-01 09:58:21,248 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:21,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:21,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:21,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-12-01 09:58:21,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:21,249 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-01 09:58:21,249 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-01 09:58:21,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2018-12-01 09:58:21,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:21,283 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-01 09:58:21,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:21,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:21,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 09:58:21,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-01 09:58:21,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 09:58:21,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:21,318 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-01 09:58:21,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 09:58:21,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-01 09:58:21,333 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 09:58:21,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2018-12-01 09:58:21,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 09:58:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-01 09:58:21,370 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-12-01 09:58:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:21,410 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-12-01 09:58:21,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 09:58:21,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-12-01 09:58:21,410 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:21,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-12-01 09:58:21,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-01 09:58:21,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-01 09:58:21,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-12-01 09:58:21,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:21,411 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-01 09:58:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-12-01 09:58:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-12-01 09:58:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-01 09:58:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-01 09:58:21,412 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-01 09:58:21,412 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-01 09:58:21,412 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 09:58:21,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-12-01 09:58:21,413 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-01 09:58:21,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:21,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:21,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-12-01 09:58:21,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:21,413 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-01 09:58:21,414 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-01 09:58:21,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2018-12-01 09:58:21,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2018-12-01 09:58:21,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2018-12-01 09:58:21,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:21,558 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-01 09:58:21,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:58:21,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 09:58:21,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 09:58:21,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-01 09:58:21,572 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-01 09:58:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:21,616 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-01 09:58:21,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 09:58:21,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-12-01 09:58:21,617 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-01 09:58:21,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-12-01 09:58:21,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 09:58:21,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 09:58:21,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-12-01 09:58:21,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:21,618 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-01 09:58:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-12-01 09:58:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-01 09:58:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-01 09:58:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-01 09:58:21,623 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-01 09:58:21,623 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-01 09:58:21,623 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 09:58:21,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-12-01 09:58:21,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-01 09:58:21,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:21,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:21,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:58:21,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:21,624 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-01 09:58:21,624 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-01 09:58:21,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2018-12-01 09:58:21,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:21,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2018-12-01 09:58:21,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:21,652 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2018-12-01 09:58:21,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:21,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:24,171 WARN L180 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-12-01 09:58:24,292 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-01 09:58:24,293 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:24,294 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:24,294 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:24,294 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:24,294 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:24,294 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:24,294 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:24,294 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:24,294 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-12-01 09:58:24,294 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:24,294 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:24,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,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-01 09:58:24,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-01 09:58:24,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-01 09:58:24,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-01 09:58:24,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-01 09:58:24,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-01 09:58:24,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:24,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:24,480 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:24,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,520 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:24,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,521 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:24,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,524 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:24,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,525 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:24,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:24,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:24,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:24,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:24,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:24,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:24,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:24,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:24,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:24,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:24,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:24,546 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:24,559 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-01 09:58:24,559 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-01 09:58:24,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:24,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:24,561 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:24,561 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-01 09:58:24,579 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 09:58:24,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 09:58:24,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:24,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:24,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:24,624 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-01 09:58:24,624 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-01 09:58:24,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-01 09:58:24,636 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-01 09:58:24,636 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-01 09:58:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-01 09:58:24,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2018-12-01 09:58:24,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:24,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2018-12-01 09:58:24,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:24,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-01 09:58:24,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:24,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-12-01 09:58:24,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 09:58:24,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-12-01 09:58:24,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-01 09:58:24,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 09:58:24,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-01 09:58:24,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:24,638 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-01 09:58:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-01 09:58:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-01 09:58:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-01 09:58:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-01 09:58:24,640 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-01 09:58:24,640 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-01 09:58:24,640 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 09:58:24,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-12-01 09:58:24,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 09:58:24,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:24,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:24,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:58:24,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:24,641 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-01 09:58:24,641 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-01 09:58:24,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2018-12-01 09:58:24,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:24,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:24,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:24,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2018-12-01 09:58:24,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:24,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:24,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2018-12-01 09:58:24,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:24,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:24,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:27,652 WARN L180 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 224 DAG size of output: 171 [2018-12-01 09:58:27,777 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-01 09:58:27,779 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:27,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:27,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:27,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:27,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:27,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:27,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:27,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:27,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-01 09:58:27,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:27,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:27,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:27,959 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:27,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:27,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:27,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:27,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:27,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:27,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:27,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:27,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:27,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:27,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:27,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:27,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:27,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:27,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:27,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:27,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:27,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:27,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:27,999 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:28,008 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 09:58:28,009 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 09:58:28,009 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:28,010 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:28,010 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:28,010 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3, ULTIMATE.start_main_~nc_B~0) = -1*ULTIMATE.start_main_~#string_B~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 - 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2018-12-01 09:58:28,018 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 09:58:28,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 09:58:28,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:28,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:28,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:28,058 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-01 09:58:28,058 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-01 09:58:28,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-01 09:58:28,068 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-01 09:58:28,068 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-01 09:58:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-12-01 09:58:28,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2018-12-01 09:58:28,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:28,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2018-12-01 09:58:28,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:28,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2018-12-01 09:58:28,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:28,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-12-01 09:58:28,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:28,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2018-12-01 09:58:28,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-01 09:58:28,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 09:58:28,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-12-01 09:58:28,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:28,072 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-01 09:58:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-12-01 09:58:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-01 09:58:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 09:58:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-01 09:58:28,074 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-01 09:58:28,074 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-01 09:58:28,074 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 09:58:28,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-12-01 09:58:28,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:28,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:28,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:28,075 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-01 09:58:28,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:28,076 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-01 09:58:28,076 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-01 09:58:28,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2018-12-01 09:58:28,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2018-12-01 09:58:28,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:28,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2018-12-01 09:58:28,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:28,137 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-01 09:58:28,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:58:28,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 09:58:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 09:58:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 09:58:28,182 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-01 09:58:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:28,190 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-01 09:58:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 09:58:28,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-12-01 09:58:28,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:28,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2018-12-01 09:58:28,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 09:58:28,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 09:58:28,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-12-01 09:58:28,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:28,192 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-01 09:58:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-12-01 09:58:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-01 09:58:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 09:58:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-01 09:58:28,193 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-01 09:58:28,194 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-01 09:58:28,194 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-01 09:58:28,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-12-01 09:58:28,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:28,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:28,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:28,195 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-01 09:58:28,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:28,195 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-01 09:58:28,195 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-01 09:58:28,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2018-12-01 09:58:28,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:28,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:28,237 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-01 09:58:28,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:28,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:28,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:28,279 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-01 09:58:28,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 09:58:28,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-12-01 09:58:28,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 09:58:28,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2018-12-01 09:58:28,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:28,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 09:58:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 09:58:28,337 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-01 09:58:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:28,368 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-01 09:58:28,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 09:58:28,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-12-01 09:58:28,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:28,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2018-12-01 09:58:28,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 09:58:28,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 09:58:28,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-12-01 09:58:28,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:28,370 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-01 09:58:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-12-01 09:58:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-01 09:58:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 09:58:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-01 09:58:28,372 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-01 09:58:28,372 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-01 09:58:28,372 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-01 09:58:28,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-12-01 09:58:28,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:28,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:28,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:28,373 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-01 09:58:28,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:28,373 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-01 09:58:28,373 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-01 09:58:28,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2018-12-01 09:58:28,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:28,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2018-12-01 09:58:28,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:28,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2018-12-01 09:58:28,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:28,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:28,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:28,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:31,238 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 261 DAG size of output: 199 [2018-12-01 09:58:31,369 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-01 09:58:31,370 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:31,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:31,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:31,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:31,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:31,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:31,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:31,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:31,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-01 09:58:31,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:31,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:31,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:31,804 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:31,804 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:31,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,823 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:31,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:31,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,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-01 09:58:31,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,828 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-01 09:58:31,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,829 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 09:58:31,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,835 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:31,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,836 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:31,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:31,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:31,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:31,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:31,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:31,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:31,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:31,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:31,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:31,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:31,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:31,850 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:31,867 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-12-01 09:58:31,867 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-12-01 09:58:31,867 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:31,868 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:31,868 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:31,868 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-01 09:58:31,904 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-12-01 09:58:31,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 09:58:31,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:31,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:31,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:31,945 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-01 09:58:31,945 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-01 09:58:31,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-01 09:58:31,954 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-01 09:58:31,954 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-01 09:58:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-01 09:58:31,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2018-12-01 09:58:31,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:31,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-01 09:58:31,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:31,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2018-12-01 09:58:31,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:31,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2018-12-01 09:58:31,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:31,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2018-12-01 09:58:31,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-01 09:58:31,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-01 09:58:31,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2018-12-01 09:58:31,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:31,956 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-01 09:58:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2018-12-01 09:58:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-01 09:58:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 09:58:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-01 09:58:31,957 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-01 09:58:31,957 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-01 09:58:31,957 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-01 09:58:31,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-12-01 09:58:31,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:31,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:31,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:31,958 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-01 09:58:31,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:31,958 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-01 09:58:31,958 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-01 09:58:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2018-12-01 09:58:31,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:31,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:31,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:31,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:31,989 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2018-12-01 09:58:31,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:31,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:31,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:31,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:31,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:31,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2018-12-01 09:58:31,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:31,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:32,035 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-01 09:58:32,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:32,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:32,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:32,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:32,094 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-01 09:58:32,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 09:58:32,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-12-01 09:58:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 09:58:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-01 09:58:32,151 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-12-01 09:58:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:32,252 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-12-01 09:58:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 09:58:32,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-12-01 09:58:32,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:32,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2018-12-01 09:58:32,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-01 09:58:32,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-01 09:58:32,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2018-12-01 09:58:32,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:32,254 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-01 09:58:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2018-12-01 09:58:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-12-01 09:58:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-01 09:58:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-01 09:58:32,256 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-01 09:58:32,256 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-01 09:58:32,256 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-01 09:58:32,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2018-12-01 09:58:32,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:32,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:32,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:32,257 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-01 09:58:32,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:32,258 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-01 09:58:32,258 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-01 09:58:32,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2018-12-01 09:58:32,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:32,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:32,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:32,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2018-12-01 09:58:32,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:32,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:32,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:32,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2018-12-01 09:58:32,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:32,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:34,639 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 310 DAG size of output: 231 [2018-12-01 09:58:34,790 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-01 09:58:34,792 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:34,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:34,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:34,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:34,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:34,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:34,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:34,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:34,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration14_Lasso [2018-12-01 09:58:34,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:34,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:34,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:34,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:35,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:35,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:35,406 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-01 09:58:35,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:35,454 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:35,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,473 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-01 09:58:35,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,474 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-12-01 09:58:35,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,483 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:35,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,483 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:35,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,486 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:35,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,486 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:35,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,490 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:35,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,490 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:35,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:35,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:35,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:35,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:35,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:35,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:35,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:35,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:35,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:35,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:35,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:35,500 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:35,508 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-01 09:58:35,509 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-01 09:58:35,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:35,509 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:35,509 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:35,509 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-01 09:58:35,577 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2018-12-01 09:58:35,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:35,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:35,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:58:35,610 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-01 09:58:35,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-01 09:58:35,616 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-01 09:58:35,617 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-01 09:58:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-01 09:58:35,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2018-12-01 09:58:35,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:35,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-01 09:58:35,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:35,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2018-12-01 09:58:35,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:35,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-12-01 09:58:35,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:35,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2018-12-01 09:58:35,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-01 09:58:35,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-01 09:58:35,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2018-12-01 09:58:35,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:35,619 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-01 09:58:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2018-12-01 09:58:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-01 09:58:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-01 09:58:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-12-01 09:58:35,620 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-01 09:58:35,620 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-01 09:58:35,620 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-01 09:58:35,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-12-01 09:58:35,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:35,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:35,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:35,621 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-01 09:58:35,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:35,621 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-01 09:58:35,621 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-01 09:58:35,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2018-12-01 09:58:35,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:35,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2018-12-01 09:58:35,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:35,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:35,640 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2018-12-01 09:58:35,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:35,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:35,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:35,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:35,699 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-01 09:58:35,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:35,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:35,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 09:58:35,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-01 09:58:35,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 09:58:35,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:35,778 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-01 09:58:35,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 09:58:35,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-01 09:58:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 09:58:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-01 09:58:35,828 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-01 09:58:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:35,934 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-12-01 09:58:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 09:58:35,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-12-01 09:58:35,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:35,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 55 states and 63 transitions. [2018-12-01 09:58:35,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-01 09:58:35,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-01 09:58:35,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-12-01 09:58:35,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:35,936 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-12-01 09:58:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-12-01 09:58:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-01 09:58:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-01 09:58:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-12-01 09:58:35,938 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-01 09:58:35,938 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-01 09:58:35,938 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-01 09:58:35,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-12-01 09:58:35,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:35,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:35,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:35,939 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-01 09:58:35,939 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:35,940 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-01 09:58:35,940 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-01 09:58:35,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash 356019245, now seen corresponding path program 4 times [2018-12-01 09:58:35,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:35,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:35,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2018-12-01 09:58:35,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:35,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:35,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:35,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:35,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:35,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1462886640, now seen corresponding path program 4 times [2018-12-01 09:58:35,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:35,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:36,014 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-01 09:58:36,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 09:58:36,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7cfdc1fc-b589-491d-b566-809a3a48cccd/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-01 09:58:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 09:58:36,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 09:58:36,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 09:58:36,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:36,082 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-01 09:58:36,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 09:58:36,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-12-01 09:58:36,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 09:58:36,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-01 09:58:36,141 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-12-01 09:58:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:58:36,207 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-01 09:58:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 09:58:36,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 90 transitions. [2018-12-01 09:58:36,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:36,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 57 states and 65 transitions. [2018-12-01 09:58:36,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-01 09:58:36,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-01 09:58:36,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-01 09:58:36,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:36,208 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-01 09:58:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-01 09:58:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-01 09:58:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-01 09:58:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-01 09:58:36,210 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-01 09:58:36,210 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-01 09:58:36,210 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-01 09:58:36,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-12-01 09:58:36,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 09:58:36,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:36,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:36,211 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-01 09:58:36,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:36,211 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-01 09:58:36,211 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-01 09:58:36,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 5 times [2018-12-01 09:58:36,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:36,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:36,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:36,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2018-12-01 09:58:36,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:36,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:36,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:36,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 5 times [2018-12-01 09:58:36,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:36,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:36,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:38,698 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 358 DAG size of output: 267 [2018-12-01 09:58:38,841 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-01 09:58:38,843 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:38,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:38,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:38,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:38,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:38,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:38,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:38,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:38,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration17_Lasso [2018-12-01 09:58:38,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:38,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:38,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-01 09:58:38,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-01 09:58:38,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:38,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-01 09:58:38,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-01 09:58:38,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-01 09:58:38,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-01 09:58:38,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-01 09:58:38,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:38,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:38,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:38,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:38,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:39,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:39,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:39,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:39,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:39,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:39,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:39,392 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-01 09:58:40,339 WARN L180 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-12-01 09:58:40,360 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:40,360 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:40,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:40,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:40,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:40,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:40,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:40,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:40,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:40,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:40,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:40,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:40,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:40,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:40,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:40,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:40,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:40,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-01 09:58:40,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:40,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:40,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:40,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:40,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:40,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:40,393 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:40,403 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 09:58:40,403 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-01 09:58:40,404 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:40,404 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:40,404 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:40,404 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-01 09:58:40,503 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-01 09:58:40,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:40,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:40,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:40,544 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-01 09:58:40,544 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-01 09:58:40,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-01 09:58:40,552 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-01 09:58:40,552 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-01 09:58:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-01 09:58:40,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-01 09:58:40,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:40,553 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 09:58:40,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:40,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:40,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:40,596 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-01 09:58:40,596 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-01 09:58:40,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-01 09:58:40,603 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-01 09:58:40,603 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-01 09:58:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-12-01 09:58:40,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-01 09:58:40,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:40,603 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 09:58:40,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:40,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:40,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:40,637 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-01 09:58:40,637 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-01 09:58:40,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-01 09:58:40,643 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-01 09:58:40,643 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-01 09:58:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-12-01 09:58:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-01 09:58:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2018-12-01 09:58:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:40,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2018-12-01 09:58:40,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:40,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2018-12-01 09:58:40,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 09:58:40,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2018-12-01 09:58:40,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-01 09:58:40,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-01 09:58:40,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-12-01 09:58:40,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:40,645 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-01 09:58:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-12-01 09:58:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-12-01 09:58:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-01 09:58:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-01 09:58:40,646 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-01 09:58:40,646 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-01 09:58:40,646 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-01 09:58:40,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2018-12-01 09:58:40,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 09:58:40,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:40,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:40,647 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-01 09:58:40,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:40,647 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-01 09:58:40,647 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-01 09:58:40,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2018-12-01 09:58:40,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:40,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:40,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:40,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:40,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2018-12-01 09:58:40,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:40,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:40,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2018-12-01 09:58:40,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:40,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:40,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:58:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:44,652 WARN L180 SmtUtils]: Spent 3.93 s on a formula simplification. DAG size of input: 309 DAG size of output: 234 [2018-12-01 09:58:44,882 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-12-01 09:58:44,884 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:44,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:44,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:44,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:44,885 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:44,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:44,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:44,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:44,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration18_Lasso [2018-12-01 09:58:44,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:44,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:44,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:44,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:45,562 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:45,562 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:45,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:45,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:45,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:45,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,580 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:45,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,580 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:45,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,584 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:45,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,585 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:45,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,589 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:45,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:45,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,593 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-01 09:58:45,593 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 09:58:45,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,595 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-12-01 09:58:45,596 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 09:58:45,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,606 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:45,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,607 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:45,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,609 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:45,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,609 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:45,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,616 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:45,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,616 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:45,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:45,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:45,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:45,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:45,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:45,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:45,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:45,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:45,636 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:45,654 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-01 09:58:45,654 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-12-01 09:58:45,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:45,655 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:45,655 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:45,655 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-01 09:58:45,785 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-12-01 09:58:45,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:45,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:45,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:45,821 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-01 09:58:45,822 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-01 09:58:45,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-01 09:58:45,839 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-01 09:58:45,840 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-01 09:58:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-01 09:58:45,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2018-12-01 09:58:45,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:45,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2018-12-01 09:58:45,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:45,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2018-12-01 09:58:45,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:45,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-12-01 09:58:45,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 09:58:45,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2018-12-01 09:58:45,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-01 09:58:45,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-01 09:58:45,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-12-01 09:58:45,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 09:58:45,841 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-01 09:58:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-12-01 09:58:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-12-01 09:58:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-01 09:58:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-12-01 09:58:45,842 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-01 09:58:45,842 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-01 09:58:45,843 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-01 09:58:45,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2018-12-01 09:58:45,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 09:58:45,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:58:45,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:58:45,843 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-01 09:58:45,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 09:58:45,844 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-01 09:58:45,844 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-01 09:58:45,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2018-12-01 09:58:45,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:45,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:45,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:45,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2018-12-01 09:58:45,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:45,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:45,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:45,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:45,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:45,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 6 times [2018-12-01 09:58:45,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:58:45,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:58:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:45,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:58:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:58:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:58:48,965 WARN L180 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 348 DAG size of output: 255 [2018-12-01 09:58:49,096 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-01 09:58:49,098 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 09:58:49,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 09:58:49,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 09:58:49,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 09:58:49,099 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 09:58:49,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 09:58:49,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 09:58:49,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 09:58:49,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration19_Lasso [2018-12-01 09:58:49,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 09:58:49,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 09:58:49,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,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-01 09:58:49,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-01 09:58:49,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-01 09:58:49,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-01 09:58:49,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 09:58:49,811 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-01 09:58:49,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 09:58:49,883 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 09:58:49,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-01 09:58:49,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:49,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:49,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:49,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:49,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:49,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:49,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:49,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:49,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:49,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 09:58:49,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 09:58:49,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 09:58:49,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,893 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-12-01 09:58:49,893 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 09:58:49,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,897 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-12-01 09:58:49,897 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 09:58:49,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,926 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:49,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,927 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:49,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,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-01 09:58:49,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,929 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:49,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,929 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:49,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:49,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:49,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:49,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:49,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,937 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 09:58:49,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,937 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 09:58:49,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 09:58:49,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 09:58:49,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 09:58:49,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 09:58:49,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 09:58:49,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 09:58:49,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 09:58:49,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 09:58:49,949 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 09:58:49,955 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 09:58:49,955 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 09:58:49,955 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 09:58:49,955 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 09:58:49,956 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 09:58:49,956 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-01 09:58:50,100 INFO L297 tatePredicateManager]: 46 out of 46 supporting invariants were superfluous and have been removed [2018-12-01 09:58:50,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:58:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:50,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:58:50,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 09:58:50,134 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-01 09:58:50,134 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-01 09:58:50,135 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-01 09:58:50,145 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-01 09:58:50,145 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-01 09:58:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 09:58:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-01 09:58:50,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2018-12-01 09:58:50,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:50,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2018-12-01 09:58:50,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:50,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2018-12-01 09:58:50,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 09:58:50,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-12-01 09:58:50,146 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 09:58:50,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-12-01 09:58:50,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 09:58:50,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 09:58:50,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 09:58:50,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:58:50,147 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 09:58:50,147 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 09:58:50,147 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 09:58:50,147 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-01 09:58:50,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 09:58:50,147 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 09:58:50,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 09:58:50,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 09:58:50 BoogieIcfgContainer [2018-12-01 09:58:50,151 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 09:58:50,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 09:58:50,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 09:58:50,152 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 09:58:50,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:58:19" (3/4) ... [2018-12-01 09:58:50,154 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 09:58:50,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 09:58:50,155 INFO L168 Benchmark]: Toolchain (without parser) took 30566.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 956.0 MB in the beginning and 936.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 332.4 MB. Max. memory is 11.5 GB. [2018-12-01 09:58:50,155 INFO L168 Benchmark]: CDTParser took 0.14 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-01 09:58:50,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.59 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 09:58:50,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.06 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 09:58:50,156 INFO L168 Benchmark]: Boogie Preprocessor took 45.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-01 09:58:50,156 INFO L168 Benchmark]: RCFGBuilder took 178.15 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-01 09:58:50,157 INFO L168 Benchmark]: BuchiAutomizer took 30159.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.9 MB). Free memory was 1.1 GB in the beginning and 936.6 MB in the end (delta: 146.2 MB). Peak memory consumption was 349.1 MB. Max. memory is 11.5 GB. [2018-12-01 09:58:50,157 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 1.3 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 09:58:50,158 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.14 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 152.59 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.06 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.15 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30159.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.9 MB). Free memory was 1.1 GB in the beginning and 936.6 MB in the end (delta: 146.2 MB). Peak memory consumption was 349.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 ms. Allocated memory is still 1.3 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 + unknown-#length-unknown[string_B] + -1 * nc_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.1s and 20 iterations. TraceHistogramMax:5. Analysis of lassos took 28.8s. 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: 33ms 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...