./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e655d34f6b59f7cc9a55d4dc4dc525a41685abad ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:58:50,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:58:50,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:58:50,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:58:50,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:58:50,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:58:50,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:58:50,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:58:50,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:58:50,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:58:50,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:58:50,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:58:50,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:58:50,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:58:50,535 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:58:50,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:58:50,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:58:50,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:58:50,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:58:50,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:58:50,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:58:50,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:58:50,553 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:58:50,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:58:50,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:58:50,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:58:50,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:58:50,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:58:50,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:58:50,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:58:50,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:58:50,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:58:50,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:58:50,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:58:50,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:58:50,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:58:50,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:58:50,587 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:58:50,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:58:50,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:58:50,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:58:50,589 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:58:50,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:58:50,590 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:58:50,590 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:58:50,590 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:58:50,590 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:58:50,590 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:58:50,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:58:50,591 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:58:50,591 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:58:50,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:58:50,591 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:58:50,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:58:50,592 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:58:50,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:58:50,592 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:58:50,592 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:58:50,592 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:58:50,592 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:58:50,593 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:58:50,593 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:58:50,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:58:50,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:58:50,593 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:58:50,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:58:50,594 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:58:50,594 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:58:50,595 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:58:50,595 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e655d34f6b59f7cc9a55d4dc4dc525a41685abad [2019-01-01 22:58:50,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:58:50,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:58:50,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:58:50,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:58:50,677 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:58:50,679 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i [2019-01-01 22:58:50,740 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1489a233/4e74e6f0169d43729bdfe604a334c5f6/FLAGcdc56491b [2019-01-01 22:58:51,218 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:58:51,219 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i [2019-01-01 22:58:51,226 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1489a233/4e74e6f0169d43729bdfe604a334c5f6/FLAGcdc56491b [2019-01-01 22:58:51,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1489a233/4e74e6f0169d43729bdfe604a334c5f6 [2019-01-01 22:58:51,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:58:51,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:58:51,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:58:51,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:58:51,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:58:51,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:51,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677bf69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51, skipping insertion in model container [2019-01-01 22:58:51,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:51,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:58:51,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:58:51,817 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:58:51,822 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:58:51,856 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:58:51,884 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:58:51,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51 WrapperNode [2019-01-01 22:58:51,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:58:51,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:58:51,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:58:51,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:58:51,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:51,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:51,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:58:51,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:58:51,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:58:51,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:58:52,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:52,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:52,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:52,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:52,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:52,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:52,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... [2019-01-01 22:58:52,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:58:52,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:58:52,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:58:52,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:58:52,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:58:52,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:58:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:58:52,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:58:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:58:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:58:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:58:52,577 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:58:52,577 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-01 22:58:52,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:52 BoogieIcfgContainer [2019-01-01 22:58:52,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:58:52,579 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:58:52,579 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:58:52,584 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:58:52,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:52,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:58:51" (1/3) ... [2019-01-01 22:58:52,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d902532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:58:52, skipping insertion in model container [2019-01-01 22:58:52,587 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:52,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:51" (2/3) ... [2019-01-01 22:58:52,587 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d902532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:58:52, skipping insertion in model container [2019-01-01 22:58:52,587 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:52,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:52" (3/3) ... [2019-01-01 22:58:52,590 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2019-01-01 22:58:52,651 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:58:52,652 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:58:52,652 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:58:52,652 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:58:52,654 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:58:52,654 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:58:52,654 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:58:52,654 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:58:52,654 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:58:52,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 22:58:52,693 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-01 22:58:52,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:52,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:52,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:58:52,700 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:52,700 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:58:52,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-01 22:58:52,703 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-01 22:58:52,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:52,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:52,703 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:58:52,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:52,711 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 14#L19-3true [2019-01-01 22:58:52,711 INFO L796 eck$LassoCheckResult]: Loop: 14#L19-3true assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 17#L19-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 14#L19-3true [2019-01-01 22:58:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:52,717 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:58:52,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:52,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:52,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:52,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 22:58:52,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:52,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 22:58:52,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:52,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:52,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:53,215 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 22:58:53,393 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 22:58:53,404 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:53,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:53,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:53,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:53,405 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:53,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:53,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:53,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:53,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 22:58:53,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:53,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:53,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,949 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-01 22:58:53,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:53,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:54,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:54,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:54,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:54,388 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 22:58:54,811 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-01 22:58:54,880 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:54,886 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:54,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 [2019-01-01 22:58:54,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:54,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:54,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,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 [2019-01-01 22:58:54,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:54,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:54,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:54,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:54,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:54,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,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 [2019-01-01 22:58:54,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:54,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:54,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:54,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:54,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:54,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:54,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:54,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:54,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:54,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:54,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:54,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:55,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:55,062 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:58:55,062 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:58:55,065 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:55,067 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:55,068 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:55,069 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-01-01 22:58:55,090 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:58:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:55,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:55,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:55,239 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 [2019-01-01 22:58:55,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-01-01 22:58:55,300 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 56 states and 85 transitions. Complement of second has 8 states. [2019-01-01 22:58:55,301 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 [2019-01-01 22:58:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-01-01 22:58:55,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 22:58:55,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:55,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 22:58:55,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:55,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 22:58:55,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:55,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 85 transitions. [2019-01-01 22:58:55,314 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:55,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 19 states and 28 transitions. [2019-01-01 22:58:55,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 22:58:55,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 22:58:55,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2019-01-01 22:58:55,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:55,323 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-01 22:58:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2019-01-01 22:58:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-01 22:58:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 22:58:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-01-01 22:58:55,352 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-01 22:58:55,352 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-01 22:58:55,353 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:58:55,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2019-01-01 22:58:55,354 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:55,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:55,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:55,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:58:55,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:55,355 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 135#L19-3 assume !(main_~i~0 < 5); 133#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 134#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 148#L23-3 [2019-01-01 22:58:55,355 INFO L796 eck$LassoCheckResult]: Loop: 148#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 149#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 148#L23-3 [2019-01-01 22:58:55,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-01-01 22:58:55,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:55,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:55,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:55,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:55,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:55,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:58:55,436 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-01-01 22:58:55,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:55,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:58:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:58:55,562 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-01 22:58:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:55,727 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-01-01 22:58:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:58:55,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-01-01 22:58:55,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:55,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2019-01-01 22:58:55,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-01 22:58:55,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-01 22:58:55,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2019-01-01 22:58:55,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:55,733 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-01-01 22:58:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2019-01-01 22:58:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-01-01 22:58:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 22:58:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-01-01 22:58:55,738 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 22:58:55,738 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 22:58:55,738 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:58:55,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-01-01 22:58:55,740 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:55,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:55,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:55,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:55,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:55,741 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 184#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 185#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 186#L19-3 assume !(main_~i~0 < 5); 182#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 183#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 197#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 198#L23-2 [2019-01-01 22:58:55,742 INFO L796 eck$LassoCheckResult]: Loop: 198#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 200#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 198#L23-2 [2019-01-01 22:58:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:55,743 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2019-01-01 22:58:55,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:55,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:55,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:58:55,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:58:55,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:55,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:55,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:58:55,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 22:58:55,882 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2019-01-01 22:58:55,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:55,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:58:56,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:58:56,033 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 22:58:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:56,103 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-01-01 22:58:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:58:56,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-01-01 22:58:56,106 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:56,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-01-01 22:58:56,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 22:58:56,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 22:58:56,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-01-01 22:58:56,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:56,109 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-01 22:58:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-01-01 22:58:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 22:58:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 22:58:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-01-01 22:58:56,113 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-01 22:58:56,113 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-01 22:58:56,113 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:58:56,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2019-01-01 22:58:56,114 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:56,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:56,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:56,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:56,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:56,117 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 263#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 264#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 265#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 266#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 283#L19-3 assume !(main_~i~0 < 5); 261#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 262#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 280#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 281#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 277#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 278#L23-2 [2019-01-01 22:58:56,117 INFO L796 eck$LassoCheckResult]: Loop: 278#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 284#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 278#L23-2 [2019-01-01 22:58:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2019-01-01 22:58:56,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:56,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:58:56,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:58:56,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:58:56,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:56,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:58:56,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:58:56,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 22:58:56,357 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2019-01-01 22:58:56,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:56,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:56,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:56,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:56,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:58:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:58:56,474 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-01-01 22:58:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:56,601 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-01-01 22:58:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:58:56,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2019-01-01 22:58:56,603 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:56,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2019-01-01 22:58:56,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 22:58:56,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 22:58:56,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2019-01-01 22:58:56,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:56,606 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-01-01 22:58:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2019-01-01 22:58:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-01 22:58:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:58:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-01 22:58:56,609 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-01 22:58:56,610 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-01 22:58:56,610 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:58:56,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-01-01 22:58:56,611 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:56,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:56,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:56,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2019-01-01 22:58:56,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:56,613 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 382#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 365#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 366#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 390#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 372#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 367#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 368#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 387#L19-3 assume !(main_~i~0 < 5); 363#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 364#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 383#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 384#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 385#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 389#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 380#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 381#L23-2 [2019-01-01 22:58:56,613 INFO L796 eck$LassoCheckResult]: Loop: 381#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 388#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 381#L23-2 [2019-01-01 22:58:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2019-01-01 22:58:56,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:56,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:56,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:56,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:58:56,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:58:56,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:58:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:56,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:56,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:58:56,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:58:56,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:58:56,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 22:58:56,811 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2019-01-01 22:58:56,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:56,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:56,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:56,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:56,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:58:56,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:58:56,869 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-01-01 22:58:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:57,033 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-01-01 22:58:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:58:57,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2019-01-01 22:58:57,036 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:57,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2019-01-01 22:58:57,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 22:58:57,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 22:58:57,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2019-01-01 22:58:57,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:57,039 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-01-01 22:58:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2019-01-01 22:58:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-01-01 22:58:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 22:58:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-01 22:58:57,044 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-01 22:58:57,044 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-01 22:58:57,044 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:58:57,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-01-01 22:58:57,045 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:57,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:57,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:57,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2019-01-01 22:58:57,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:57,046 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 490#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 491#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 492#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 493#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 497#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 516#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 515#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 512#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 511#L19-3 assume !(main_~i~0 < 5); 488#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 489#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 508#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 509#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 505#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 506#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 519#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 518#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 517#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 514#L23-2 [2019-01-01 22:58:57,046 INFO L796 eck$LassoCheckResult]: Loop: 514#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 513#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 514#L23-2 [2019-01-01 22:58:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2019-01-01 22:58:57,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:57,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:57,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:57,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 22:58:57,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:58:57,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:58:57,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:58:57,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 22:58:57,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:58:57,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 22:58:57,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:58:57,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 22:58:57,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2019-01-01 22:58:57,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:57,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:58:57,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:58:57,291 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-01 22:58:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:57,422 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-01 22:58:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:58:57,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-01 22:58:57,424 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:57,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-01 22:58:57,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-01 22:58:57,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 22:58:57,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-01 22:58:57,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:57,427 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-01 22:58:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-01 22:58:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2019-01-01 22:58:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 22:58:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-01 22:58:57,435 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-01 22:58:57,435 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-01 22:58:57,435 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:58:57,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2019-01-01 22:58:57,438 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:58:57,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:57,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:57,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2019-01-01 22:58:57,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:57,440 INFO L794 eck$LassoCheckResult]: Stem: 654#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 636#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 637#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 638#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 639#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 661#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 660#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 659#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 658#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 657#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 656#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 655#L19-3 assume !(main_~i~0 < 5); 634#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 635#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 650#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 651#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 653#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 669#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 668#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 667#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 666#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 665#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 664#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 663#L23-2 [2019-01-01 22:58:57,440 INFO L796 eck$LassoCheckResult]: Loop: 663#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 662#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 663#L23-2 [2019-01-01 22:58:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2019-01-01 22:58:57,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:57,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:57,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2019-01-01 22:58:57,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:57,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:57,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2019-01-01 22:58:57,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:57,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:57,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-01 22:58:57,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:57,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 22:58:57,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 22:58:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 22:58:57,918 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-01-01 22:58:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:58,094 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-01-01 22:58:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:58:58,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-01-01 22:58:58,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-01 22:58:58,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-01-01 22:58:58,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 22:58:58,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:58:58,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-01-01 22:58:58,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:58,102 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-01 22:58:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-01-01 22:58:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-01 22:58:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 22:58:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-01 22:58:58,108 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-01 22:58:58,108 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-01 22:58:58,108 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:58:58,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2019-01-01 22:58:58,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-01 22:58:58,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:58,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:58,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:58,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:58,115 INFO L794 eck$LassoCheckResult]: Stem: 741#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 739#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 723#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 724#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 725#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 726#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 756#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 755#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 754#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 753#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 752#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 743#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 742#L19-3 assume !(main_~i~0 < 5); 721#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 722#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 737#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 738#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 740#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 751#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 750#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 749#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 748#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 747#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 746#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 745#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 744#L23-3 assume !(main_~i~0 < 5); 735#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 736#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 729#L28-3 [2019-01-01 22:58:58,115 INFO L796 eck$LassoCheckResult]: Loop: 729#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 727#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 729#L28-3 [2019-01-01 22:58:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2019-01-01 22:58:58,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:58,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:58,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2019-01-01 22:58:58,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:58,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:58,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:58,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:58,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2019-01-01 22:58:58,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:58,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:02,046 WARN L181 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 216 DAG size of output: 164 [2019-01-01 22:59:02,215 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-01 22:59:02,217 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:02,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:02,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:02,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:02,218 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:02,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:02,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:02,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:02,218 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-01 22:59:02,218 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:02,218 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:02,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,492 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-01 22:59:02,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:02,889 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:02,890 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:02,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:02,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:02,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:02,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:02,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:02,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:02,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:02,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:02,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,983 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:59:02,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,984 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:59:02,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:02,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,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 [2019-01-01 22:59:02,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:02,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:02,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:02,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:02,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:02,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:02,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:02,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:02,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:02,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:02,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:02,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:02,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:03,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:03,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:03,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:03,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:03,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:03,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:03,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:03,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:03,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:03,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:03,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:03,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:03,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:03,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:03,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:03,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:03,015 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:03,025 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:59:03,025 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:59:03,025 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:03,026 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:59:03,026 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:03,026 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 [] [2019-01-01 22:59:03,094 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 22:59:03,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:59:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:03,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:03,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:03,164 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 [2019-01-01 22:59:03,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 22:59:03,193 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. [2019-01-01 22:59:03,194 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 [2019-01-01 22:59:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-01 22:59:03,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2019-01-01 22:59:03,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:03,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2019-01-01 22:59:03,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:03,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-01 22:59:03,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:03,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2019-01-01 22:59:03,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:59:03,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-01-01 22:59:03,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 22:59:03,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:59:03,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-01-01 22:59:03,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:03,203 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-01 22:59:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-01-01 22:59:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 22:59:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 22:59:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-01 22:59:03,208 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-01 22:59:03,208 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-01 22:59:03,208 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:59:03,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-01-01 22:59:03,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:59:03,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:03,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:03,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:59:03,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:03,212 INFO L794 eck$LassoCheckResult]: Stem: 949#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 946#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 929#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 930#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 931#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 932#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 957#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 956#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 955#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 954#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 953#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 952#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 951#L19-3 assume !(main_~i~0 < 5); 927#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 928#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 948#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 947#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 944#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 945#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 964#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 963#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 962#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 961#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 960#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 959#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 958#L23-3 assume !(main_~i~0 < 5); 942#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 943#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 950#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 933#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 934#L28-4 main_~nc_B~0 := 0; 940#L32-3 [2019-01-01 22:59:03,212 INFO L796 eck$LassoCheckResult]: Loop: 940#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 941#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 940#L32-3 [2019-01-01 22:59:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2019-01-01 22:59:03,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:03,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:03,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2019-01-01 22:59:03,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:03,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:03,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:03,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:03,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2019-01-01 22:59:03,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:03,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:03,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:03,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:03,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:06,955 WARN L181 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 227 DAG size of output: 174 [2019-01-01 22:59:07,123 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-01 22:59:07,126 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:07,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:07,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:07,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:07,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:07,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:07,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:07,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:07,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-01 22:59:07,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:07,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:07,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:07,720 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:07,721 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:07,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:07,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:07,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:07,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:07,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:07,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:07,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:07,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:07,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:07,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:07,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:07,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:07,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:07,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:07,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:07,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:07,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:07,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:07,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:07,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:07,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:07,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:07,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:07,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:07,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:07,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:07,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:07,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:07,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:07,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:07,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:07,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:07,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:07,769 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:59:07,770 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 22:59:07,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:07,771 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:59:07,771 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:07,771 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3) = -1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 Supporting invariants [] [2019-01-01 22:59:07,860 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 22:59:07,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:59:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:08,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:08,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:08,080 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 [2019-01-01 22:59:08,080 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:59:08,100 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. [2019-01-01 22:59:08,102 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 [2019-01-01 22:59:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-01 22:59:08,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2019-01-01 22:59:08,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:08,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2019-01-01 22:59:08,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:08,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2019-01-01 22:59:08,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:08,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2019-01-01 22:59:08,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:08,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2019-01-01 22:59:08,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 22:59:08,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:59:08,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2019-01-01 22:59:08,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:08,106 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-01 22:59:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2019-01-01 22:59:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 22:59:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:59:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-01 22:59:08,111 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-01 22:59:08,111 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-01 22:59:08,111 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:59:08,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2019-01-01 22:59:08,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:08,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:08,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:08,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:59:08,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:08,116 INFO L794 eck$LassoCheckResult]: Stem: 1167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1164#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1145#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1146#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1147#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1148#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1175#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1174#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1173#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1172#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1171#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1170#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1169#L19-3 assume !(main_~i~0 < 5); 1143#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1144#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1165#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1166#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1162#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1163#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1182#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1181#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1180#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1179#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1178#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1177#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1176#L23-3 assume !(main_~i~0 < 5); 1160#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1161#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1168#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1149#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1150#L28-4 main_~nc_B~0 := 0; 1156#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1158#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1153#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1154#L41-2 [2019-01-01 22:59:08,116 INFO L796 eck$LassoCheckResult]: Loop: 1154#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1155#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1154#L41-2 [2019-01-01 22:59:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2019-01-01 22:59:08,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:08,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:08,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:08,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2019-01-01 22:59:08,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:08,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:08,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:08,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2019-01-01 22:59:08,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:08,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:08,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:08,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 22:59:08,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:59:08,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:59:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:59:08,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:59:08,351 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-01-01 22:59:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:59:08,363 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-01-01 22:59:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:59:08,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2019-01-01 22:59:08,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:08,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2019-01-01 22:59:08,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 22:59:08,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:59:08,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2019-01-01 22:59:08,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:08,368 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-01 22:59:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2019-01-01 22:59:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-01 22:59:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:59:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-01 22:59:08,375 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-01 22:59:08,375 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-01 22:59:08,375 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:59:08,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2019-01-01 22:59:08,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:08,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:08,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:08,378 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] [2019-01-01 22:59:08,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:08,378 INFO L794 eck$LassoCheckResult]: Stem: 1265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1263#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1243#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1244#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1245#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1246#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1251#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1272#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1271#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1270#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1269#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1268#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1267#L19-3 assume !(main_~i~0 < 5); 1241#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1242#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1261#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1262#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1264#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1280#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1279#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1278#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1277#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1276#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1275#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1274#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1273#L23-3 assume !(main_~i~0 < 5); 1259#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1260#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1266#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1249#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1250#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1247#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1248#L28-4 main_~nc_B~0 := 0; 1255#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1257#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1252#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1253#L41-2 [2019-01-01 22:59:08,378 INFO L796 eck$LassoCheckResult]: Loop: 1253#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1254#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1253#L41-2 [2019-01-01 22:59:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2019-01-01 22:59:08,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:08,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 22:59:08,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:59:08,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:59:08,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:08,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 22:59:09,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:59:09,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-01-01 22:59:09,278 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:59:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2019-01-01 22:59:09,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:09,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 22:59:09,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 22:59:09,423 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-01-01 22:59:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:59:09,489 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-01-01 22:59:09,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:59:09,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2019-01-01 22:59:09,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:09,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2019-01-01 22:59:09,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 22:59:09,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 22:59:09,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2019-01-01 22:59:09,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:09,493 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-01 22:59:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2019-01-01 22:59:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-01 22:59:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:59:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-01 22:59:09,496 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-01 22:59:09,496 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-01 22:59:09,496 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:59:09,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2019-01-01 22:59:09,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:09,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:09,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:09,498 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] [2019-01-01 22:59:09,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:09,498 INFO L794 eck$LassoCheckResult]: Stem: 1467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1465#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1446#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1447#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1448#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1449#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1475#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1474#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1473#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1472#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1471#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1470#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1469#L19-3 assume !(main_~i~0 < 5); 1444#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1445#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1463#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1464#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1466#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1483#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1482#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1481#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1480#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1479#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1478#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1477#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1476#L23-3 assume !(main_~i~0 < 5); 1461#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1462#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1468#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1452#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1453#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1450#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1451#L28-4 main_~nc_B~0 := 0; 1457#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1458#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1459#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1460#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1454#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1455#L41-2 [2019-01-01 22:59:09,498 INFO L796 eck$LassoCheckResult]: Loop: 1455#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1456#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1455#L41-2 [2019-01-01 22:59:09,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2019-01-01 22:59:09,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:09,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:09,537 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2019-01-01 22:59:09,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:09,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2019-01-01 22:59:09,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:09,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:09,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:09,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:09,928 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 22:59:10,219 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 22:59:14,959 WARN L181 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 264 DAG size of output: 202 [2019-01-01 22:59:15,217 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-01 22:59:15,220 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:15,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:15,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:15,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:15,220 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:15,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:15,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:15,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:15,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration12_Lasso [2019-01-01 22:59:15,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:15,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:15,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,604 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-01-01 22:59:15,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:15,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:16,442 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:16,442 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:16,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:16,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:16,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:16,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:16,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:16,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:16,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:16,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:16,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:16,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:16,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:16,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:16,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:16,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:16,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:16,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,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 [2019-01-01 22:59:16,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,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 [2019-01-01 22:59:16,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:16,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:16,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:16,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,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 [2019-01-01 22:59:16,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,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 [2019-01-01 22:59:16,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,465 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:59:16,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,467 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:59:16,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:16,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:16,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:16,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,480 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:59:16,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,481 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:59:16,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:16,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,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 [2019-01-01 22:59:16,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:16,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 [2019-01-01 22:59:16,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:16,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:16,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:16,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:16,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:16,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:16,517 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:16,552 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-01 22:59:16,552 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2019-01-01 22:59:16,553 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:16,553 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:59:16,553 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:16,553 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_B~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2019-01-01 22:59:16,672 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-01 22:59:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:16,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:16,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:16,806 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 [2019-01-01 22:59:16,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 22:59:16,828 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. [2019-01-01 22:59:16,830 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 [2019-01-01 22:59:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-01-01 22:59:16,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2019-01-01 22:59:16,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:16,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2019-01-01 22:59:16,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:16,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2019-01-01 22:59:16,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:16,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2019-01-01 22:59:16,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:16,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2019-01-01 22:59:16,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 22:59:16,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:59:16,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2019-01-01 22:59:16,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:16,835 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-01 22:59:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2019-01-01 22:59:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-01 22:59:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 22:59:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-01-01 22:59:16,838 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-01 22:59:16,839 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-01 22:59:16,839 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:59:16,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2019-01-01 22:59:16,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:16,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:16,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:16,840 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] [2019-01-01 22:59:16,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:16,840 INFO L794 eck$LassoCheckResult]: Stem: 1753#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1750#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1727#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1728#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1729#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1730#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1761#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1760#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1759#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1758#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1757#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1756#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1755#L19-3 assume !(main_~i~0 < 5); 1725#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1726#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1751#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1752#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1748#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1749#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1768#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1767#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1766#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1765#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1764#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1763#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1762#L23-3 assume !(main_~i~0 < 5); 1746#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1747#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1754#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1733#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1734#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1731#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1732#L28-4 main_~nc_B~0 := 0; 1742#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1743#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1744#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1745#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1735#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1736#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1741#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 1737#L41-2 [2019-01-01 22:59:16,841 INFO L796 eck$LassoCheckResult]: Loop: 1737#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1738#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1737#L41-2 [2019-01-01 22:59:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2019-01-01 22:59:16,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:16,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:16,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2019-01-01 22:59:16,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:16,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:16,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2019-01-01 22:59:16,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:16,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:16,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:16,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:16,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-01 22:59:17,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:59:17,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:59:17,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:17,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-01 22:59:17,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:59:17,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-01-01 22:59:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 22:59:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-01 22:59:17,360 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-01-01 22:59:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:59:17,616 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-01-01 22:59:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 22:59:17,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2019-01-01 22:59:17,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:17,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2019-01-01 22:59:17,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 22:59:17,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:59:17,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2019-01-01 22:59:17,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:17,620 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-01-01 22:59:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2019-01-01 22:59:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-01 22:59:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 22:59:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-01-01 22:59:17,622 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-01-01 22:59:17,623 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-01-01 22:59:17,623 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 22:59:17,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2019-01-01 22:59:17,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:17,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:17,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:17,624 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] [2019-01-01 22:59:17,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:17,624 INFO L794 eck$LassoCheckResult]: Stem: 2022#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2020#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1996#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1997#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1998#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1999#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2033#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2032#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2031#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2029#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2028#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2026#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2025#L19-3 assume !(main_~i~0 < 5); 1994#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1995#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2017#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2018#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2021#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2041#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2040#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2039#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2038#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2037#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2036#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2035#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2034#L23-3 assume !(main_~i~0 < 5); 2015#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2016#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2023#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2002#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2003#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2024#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2027#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2000#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2001#L28-4 main_~nc_B~0 := 0; 2011#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2012#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2013#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2014#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2030#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2019#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2004#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2005#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2010#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2006#L41-2 [2019-01-01 22:59:17,625 INFO L796 eck$LassoCheckResult]: Loop: 2006#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2007#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2006#L41-2 [2019-01-01 22:59:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2019-01-01 22:59:17,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:17,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:17,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2019-01-01 22:59:17,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:17,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:17,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:17,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:17,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2019-01-01 22:59:17,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:17,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:17,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:17,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:17,839 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 22:59:21,215 WARN L181 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 313 DAG size of output: 234 [2019-01-01 22:59:21,503 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-01-01 22:59:21,507 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:21,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:21,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:21,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:21,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:21,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:21,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:21,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:21,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-01 22:59:21,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:21,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:21,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:21,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:22,103 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-01-01 22:59:22,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:22,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:22,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:22,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:22,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:22,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:23,121 WARN L181 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-01 22:59:23,305 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:23,305 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:23,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:23,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:23,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:23,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:23,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:23,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:23,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:23,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,334 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-01 22:59:23,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,337 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-01-01 22:59:23,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,350 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:59:23,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,352 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:59:23,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:23,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:23,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:23,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:23,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:23,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:23,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:23,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:23,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:23,377 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:23,399 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-01 22:59:23,399 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2019-01-01 22:59:23,400 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:23,400 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:59:23,401 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:23,401 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_B~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2019-01-01 22:59:23,947 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-01-01 22:59:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:23,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:24,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:24,019 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 [2019-01-01 22:59:24,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:59:24,030 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. [2019-01-01 22:59:24,032 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 [2019-01-01 22:59:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-01 22:59:24,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2019-01-01 22:59:24,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:24,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2019-01-01 22:59:24,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:24,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2019-01-01 22:59:24,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:24,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2019-01-01 22:59:24,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:24,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2019-01-01 22:59:24,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 22:59:24,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 22:59:24,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2019-01-01 22:59:24,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:24,036 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-01 22:59:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2019-01-01 22:59:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-01 22:59:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 22:59:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-01-01 22:59:24,042 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-01 22:59:24,042 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-01 22:59:24,042 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 22:59:24,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2019-01-01 22:59:24,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:24,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:24,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:24,044 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] [2019-01-01 22:59:24,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:24,044 INFO L794 eck$LassoCheckResult]: Stem: 2387#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2385#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 2359#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2360#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2361#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2362#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2398#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2396#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2395#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2394#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2393#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2391#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2390#L19-3 assume !(main_~i~0 < 5); 2357#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2358#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2382#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2383#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2386#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2406#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2405#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2404#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2403#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2402#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2401#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2400#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2399#L23-3 assume !(main_~i~0 < 5); 2378#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2379#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2388#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2365#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2366#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2389#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2392#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2363#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2364#L28-4 main_~nc_B~0 := 0; 2374#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2375#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2376#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2377#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2397#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2384#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2367#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2368#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2380#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2381#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2373#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2369#L41-2 [2019-01-01 22:59:24,044 INFO L796 eck$LassoCheckResult]: Loop: 2369#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2370#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2369#L41-2 [2019-01-01 22:59:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2019-01-01 22:59:24,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:24,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:24,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:24,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2019-01-01 22:59:24,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:24,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:24,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:24,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:24,126 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2019-01-01 22:59:24,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:24,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:24,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:24,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:24,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-01 22:59:24,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:59:24,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:59:24,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:59:24,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 22:59:24,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:59:24,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-01 22:59:24,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:59:24,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-01 22:59:24,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 22:59:24,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-01 22:59:24,768 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-01-01 22:59:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:59:25,085 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-01-01 22:59:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-01 22:59:25,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2019-01-01 22:59:25,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:25,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 58 states and 66 transitions. [2019-01-01 22:59:25,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 22:59:25,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 22:59:25,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2019-01-01 22:59:25,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:25,088 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-01-01 22:59:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2019-01-01 22:59:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-01 22:59:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 22:59:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-01-01 22:59:25,091 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-01 22:59:25,091 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-01 22:59:25,091 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 22:59:25,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2019-01-01 22:59:25,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:59:25,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:25,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:25,093 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] [2019-01-01 22:59:25,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:25,093 INFO L794 eck$LassoCheckResult]: Stem: 2717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2713#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 2689#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2690#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2691#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2692#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2730#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2727#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2726#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2725#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2724#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2722#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2721#L19-3 assume !(main_~i~0 < 5); 2687#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2688#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2711#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2712#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2716#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2738#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2737#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2736#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2735#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2734#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2733#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2732#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2731#L23-3 assume !(main_~i~0 < 5); 2708#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2709#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2718#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2719#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2739#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2695#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2696#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2720#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2723#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2693#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2694#L28-4 main_~nc_B~0 := 0; 2704#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2705#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2706#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2707#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2715#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2729#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2728#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2714#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2697#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2698#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2703#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2710#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2740#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2699#L41-2 [2019-01-01 22:59:25,094 INFO L796 eck$LassoCheckResult]: Loop: 2699#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2700#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2699#L41-2 [2019-01-01 22:59:25,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 4 times [2019-01-01 22:59:25,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:25,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:25,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:25,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:25,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2019-01-01 22:59:25,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:25,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:25,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:25,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:25,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:25,143 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 4 times [2019-01-01 22:59:25,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:25,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:25,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:25,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:25,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:25,529 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 22:59:25,824 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 22:59:30,887 WARN L181 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 361 DAG size of output: 272 [2019-01-01 22:59:31,188 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-01 22:59:31,192 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:31,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:31,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:31,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:31,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:31,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:31,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:31,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:31,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration16_Lasso [2019-01-01 22:59:31,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:31,193 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:31,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:31,954 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-01-01 22:59:32,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:32,442 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 22:59:34,027 WARN L181 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-01-01 22:59:34,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:34,133 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:34,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:34,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:34,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:34,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:34,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:34,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:34,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:34,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:34,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:34,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:34,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:34,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:34,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:34,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:34,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:34,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:34,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:34,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:34,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,188 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:59:34,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,189 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:59:34,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,208 INFO L205 nArgumentSynthesizer]: 36 stem disjuncts [2019-01-01 22:59:34,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,221 INFO L402 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-01-01 22:59:34,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,273 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:59:34,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,274 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:59:34,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,276 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:59:34,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:59:34,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:34,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:34,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:34,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:34,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:34,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:34,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:34,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:34,295 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:34,313 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:59:34,313 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:59:34,314 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:34,314 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:59:34,315 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:34,315 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 [] [2019-01-01 22:59:34,666 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-01-01 22:59:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:34,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:34,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:34,802 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 [2019-01-01 22:59:34,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-01 22:59:34,821 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. [2019-01-01 22:59:34,822 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 [2019-01-01 22:59:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-01 22:59:34,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-01 22:59:34,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:34,823 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:59:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:34,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:34,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:34,918 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 [2019-01-01 22:59:34,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-01 22:59:34,944 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. [2019-01-01 22:59:34,947 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 [2019-01-01 22:59:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-01 22:59:34,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-01 22:59:34,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:34,948 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:59:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:35,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:35,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:35,166 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 [2019-01-01 22:59:35,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-01 22:59:35,212 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. [2019-01-01 22:59:35,214 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 [2019-01-01 22:59:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-01-01 22:59:35,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-01 22:59:35,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:35,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2019-01-01 22:59:35,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:35,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2019-01-01 22:59:35,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:35,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2019-01-01 22:59:35,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:59:35,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2019-01-01 22:59:35,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 22:59:35,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 22:59:35,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2019-01-01 22:59:35,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:35,222 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-01 22:59:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2019-01-01 22:59:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-01-01 22:59:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 22:59:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-01-01 22:59:35,230 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-01-01 22:59:35,230 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-01-01 22:59:35,230 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 22:59:35,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2019-01-01 22:59:35,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:59:35,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:35,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:35,232 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] [2019-01-01 22:59:35,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:35,232 INFO L794 eck$LassoCheckResult]: Stem: 3575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3570#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 3549#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3550#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3551#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3552#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3587#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3586#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3585#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3583#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3582#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3579#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3578#L19-3 assume !(main_~i~0 < 5); 3547#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3548#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3573#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3574#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3568#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3569#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3596#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3595#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3594#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3593#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3592#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3591#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3590#L23-3 assume !(main_~i~0 < 5); 3566#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3567#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3576#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3555#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3556#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3577#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3584#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3581#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3580#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3553#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3554#L28-4 main_~nc_B~0 := 0; 3562#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3563#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3564#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3565#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3572#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3589#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3588#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3571#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3557#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3558#L41-2 [2019-01-01 22:59:35,232 INFO L796 eck$LassoCheckResult]: Loop: 3558#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3560#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3558#L41-2 [2019-01-01 22:59:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2019-01-01 22:59:35,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:35,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2019-01-01 22:59:35,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:35,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:35,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:35,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 5 times [2019-01-01 22:59:35,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:35,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:35,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:35,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:35,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:35,473 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:59:39,458 WARN L181 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 312 DAG size of output: 232 [2019-01-01 22:59:39,660 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-01 22:59:39,663 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:39,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:39,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:39,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:39,664 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:39,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:39,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:39,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:39,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration17_Lasso [2019-01-01 22:59:39,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:39,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:39,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:39,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,314 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-01-01 22:59:40,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:41,062 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:41,062 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:41,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:41,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:41,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:41,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,105 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:59:41,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,106 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:59:41,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,115 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:59:41,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,116 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:59:41,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:41,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:41,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:41,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,164 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:41,196 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:59:41,197 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:59:41,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:41,197 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:59:41,198 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:41,200 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 22:59:41,615 INFO L297 tatePredicateManager]: 42 out of 43 supporting invariants were superfluous and have been removed [2019-01-01 22:59:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:41,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:41,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:41,694 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 [2019-01-01 22:59:41,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:59:41,735 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. [2019-01-01 22:59:41,737 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 [2019-01-01 22:59:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-01 22:59:41,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2019-01-01 22:59:41,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:41,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2019-01-01 22:59:41,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:41,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2019-01-01 22:59:41,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:41,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2019-01-01 22:59:41,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:59:41,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2019-01-01 22:59:41,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 22:59:41,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:59:41,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2019-01-01 22:59:41,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:41,742 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-01-01 22:59:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2019-01-01 22:59:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-01-01 22:59:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 22:59:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-01-01 22:59:41,744 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-01 22:59:41,744 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-01 22:59:41,744 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-01 22:59:41,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2019-01-01 22:59:41,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:59:41,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:41,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:41,746 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] [2019-01-01 22:59:41,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:41,746 INFO L794 eck$LassoCheckResult]: Stem: 4032#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4030#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 4005#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4006#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4007#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4008#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4044#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4043#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4042#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4040#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4039#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4036#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4035#L19-3 assume !(main_~i~0 < 5); 4003#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4004#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4027#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4028#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4031#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4055#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4054#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4053#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4052#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4051#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4050#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4049#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4048#L23-3 assume !(main_~i~0 < 5); 4022#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4023#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4033#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4011#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4012#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4034#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4041#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4038#L28-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4037#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4009#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4010#L28-4 main_~nc_B~0 := 0; 4018#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4019#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4020#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4021#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4047#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4046#L32-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4045#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4029#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4013#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4014#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4015#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 4026#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4024#L41 [2019-01-01 22:59:41,746 INFO L796 eck$LassoCheckResult]: Loop: 4024#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4025#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4024#L41 [2019-01-01 22:59:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2019-01-01 22:59:41,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:41,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:41,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2019-01-01 22:59:41,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:41,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:41,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:41,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:41,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 5 times [2019-01-01 22:59:41,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:41,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:41,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:41,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:41,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:42,181 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 22:59:42,519 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 22:59:48,404 WARN L181 SmtUtils]: Spent 5.88 s on a formula simplification. DAG size of input: 351 DAG size of output: 260 [2019-01-01 22:59:48,728 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-01-01 22:59:48,731 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:48,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:48,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:48,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:48,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:48,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:48,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:48,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:48,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration18_Lasso [2019-01-01 22:59:48,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:48,731 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:48,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:48,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:48,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:48,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:48,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:48,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:48,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,565 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-01-01 22:59:49,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:49,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:50,404 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 22:59:50,556 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:50,556 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:50,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 [2019-01-01 22:59:50,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:50,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:50,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:50,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:50,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:50,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:50,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:50,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:50,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 [2019-01-01 22:59:50,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:50,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:50,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:50,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:50,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:50,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:50,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:50,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:50,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:50,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:50,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:50,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:50,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:50,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:50,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:50,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:50,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:50,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:50,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:50,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:50,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:50,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:50,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:50,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:50,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:50,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:50,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 [2019-01-01 22:59:50,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:50,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:50,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:50,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:50,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:50,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:50,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:50,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:50,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:50,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:50,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:50,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:50,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:50,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:50,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:50,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:50,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:50,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 [2019-01-01 22:59:50,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:50,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:50,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:50,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:50,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:50,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:50,578 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:50,591 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:59:50,591 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:59:50,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:50,592 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:59:50,592 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:50,592 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2019-01-01 22:59:51,024 INFO L297 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2019-01-01 22:59:51,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:51,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:51,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:51,096 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 [2019-01-01 22:59:51,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-01 22:59:51,121 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. [2019-01-01 22:59:51,123 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 [2019-01-01 22:59:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 22:59:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2019-01-01 22:59:51,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2019-01-01 22:59:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2019-01-01 22:59:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:51,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2019-01-01 22:59:51,126 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:59:51,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2019-01-01 22:59:51,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:59:51,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:59:51,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:59:51,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:59:51,127 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:59:51,127 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:59:51,127 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:59:51,127 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-01 22:59:51,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:59:51,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:59:51,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:59:51,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:59:51 BoogieIcfgContainer [2019-01-01 22:59:51,135 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:59:51,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:59:51,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:59:51,136 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:59:51,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:52" (3/4) ... [2019-01-01 22:59:51,142 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:59:51,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:59:51,143 INFO L168 Benchmark]: Toolchain (without parser) took 59570.56 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 470.8 MB). Free memory was 950.0 MB in the beginning and 843.8 MB in the end (delta: 106.3 MB). Peak memory consumption was 577.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:59:51,144 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:59:51,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.41 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:59:51,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:59:51,146 INFO L168 Benchmark]: Boogie Preprocessor took 101.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:59:51,147 INFO L168 Benchmark]: RCFGBuilder took 550.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:59:51,148 INFO L168 Benchmark]: BuchiAutomizer took 58556.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.1 GB in the beginning and 844.1 MB in the end (delta: 273.5 MB). Peak memory consumption was 595.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:59:51,149 INFO L168 Benchmark]: Witness Printer took 6.18 ms. Allocated memory is still 1.5 GB. Free memory was 844.1 MB in the beginning and 843.8 MB in the end (delta: 318.0 kB). Peak memory consumption was 318.0 kB. Max. memory is 11.5 GB. [2019-01-01 22:59:51,156 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.41 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 550.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 58556.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.1 GB in the beginning and 844.1 MB in the end (delta: 273.5 MB). Peak memory consumption was 595.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.18 ms. Allocated memory is still 1.5 GB. Free memory was 844.1 MB in the beginning and 843.8 MB in the end (delta: 318.0 kB). Peak memory consumption was 318.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (10 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 3 locations. One deterministic module has affine ranking function -1 * string_B + -1 * nc_B + unknown-#length-unknown[string_B] and consists of 3 locations. One deterministic module has affine ranking function -1 * j + nc_B and consists of 3 locations. One deterministic module has affine ranking function -1 * j + nc_B and consists of 3 locations. One deterministic module has affine ranking function nc_A + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + j + nc_A and consists of 4 locations. One nondeterministic module has affine ranking function nc_B + -1 * j and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 58.5s and 19 iterations. TraceHistogramMax:5. Analysis of lassos took 55.1s. Construction of modules took 1.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 58 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 15. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 354 SDtfs, 399 SDslu, 392 SDs, 0 SdLazy, 593 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital312 mio100 ax100 hnf99 lsp96 ukn46 mio100 lsp54 div100 bol100 ite100 ukn100 eq171 hnf84 smp93 dnf320 smp85 tf100 neg92 sie129 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 36 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 76 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...