./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-libowfat/strspn_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash aca5f83919a6623f93755f2c57c9c6598ba71e3b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 21:42:06,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:42:06,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:42:06,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:42:06,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:42:06,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:42:06,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:42:06,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:42:06,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:42:06,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:42:06,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:42:06,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:42:06,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:42:06,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:42:06,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:42:06,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:42:06,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:42:06,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:42:06,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:42:06,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:42:06,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:42:06,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:42:06,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:42:06,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:42:06,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:42:06,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:42:06,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:42:06,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:42:06,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:42:06,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:42:06,635 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:42:06,636 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:42:06,636 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:42:06,636 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:42:06,637 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:42:06,638 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:42:06,638 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:42:06,658 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:42:06,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:42:06,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:42:06,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:42:06,661 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:42:06,661 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:42:06,661 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:42:06,661 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:42:06,662 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:42:06,662 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:42:06,662 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:42:06,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:42:06,662 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:42:06,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:42:06,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:42:06,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:42:06,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:42:06,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:42:06,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:42:06,664 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:42:06,665 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:42:06,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:42:06,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:42:06,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:42:06,665 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:42:06,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:42:06,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:42:06,666 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:42:06,667 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:42:06,667 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aca5f83919a6623f93755f2c57c9c6598ba71e3b [2019-01-01 21:42:06,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:42:06,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:42:06,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:42:06,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:42:06,732 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:42:06,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strspn_true-termination.c.i [2019-01-01 21:42:06,795 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf7e7b8b/eadf89fdbffc4642a208639a628d83fe/FLAG3acb6fb02 [2019-01-01 21:42:07,315 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:42:07,316 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strspn_true-termination.c.i [2019-01-01 21:42:07,331 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf7e7b8b/eadf89fdbffc4642a208639a628d83fe/FLAG3acb6fb02 [2019-01-01 21:42:07,613 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf7e7b8b/eadf89fdbffc4642a208639a628d83fe [2019-01-01 21:42:07,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:42:07,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:42:07,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:07,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:42:07,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:42:07,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:07" (1/1) ... [2019-01-01 21:42:07,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420f99b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:07, skipping insertion in model container [2019-01-01 21:42:07,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:07" (1/1) ... [2019-01-01 21:42:07,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:42:07,689 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:42:08,125 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:08,137 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:42:08,258 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:08,324 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:42:08,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08 WrapperNode [2019-01-01 21:42:08,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:08,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:08,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:42:08,326 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:42:08,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:08,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:42:08,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:42:08,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:42:08,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (1/1) ... [2019-01-01 21:42:08,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:42:08,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:42:08,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:42:08,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:42:08,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (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 21:42:08,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:42:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:42:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:42:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:42:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:42:08,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:42:08,921 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:42:08,921 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:42:08,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:08 BoogieIcfgContainer [2019-01-01 21:42:08,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:42:08,924 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:42:08,924 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:42:08,929 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:42:08,930 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:08,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:42:07" (1/3) ... [2019-01-01 21:42:08,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@680a9ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:08, skipping insertion in model container [2019-01-01 21:42:08,933 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:08,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:08" (2/3) ... [2019-01-01 21:42:08,934 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@680a9ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:08, skipping insertion in model container [2019-01-01 21:42:08,934 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:08,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:08" (3/3) ... [2019-01-01 21:42:08,937 INFO L375 chiAutomizerObserver]: Analyzing ICFG strspn_true-termination.c.i [2019-01-01 21:42:09,003 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:42:09,004 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:42:09,004 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:42:09,004 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:42:09,005 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:42:09,005 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:42:09,005 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:42:09,005 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:42:09,005 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:42:09,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:42:09,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:42:09,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:09,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:09,052 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:42:09,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:09,052 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:42:09,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:42:09,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:42:09,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:09,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:09,055 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:42:09,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:09,065 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 9#L521true assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 6#L525true assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 19#L510-4true [2019-01-01 21:42:09,066 INFO L796 eck$LassoCheckResult]: Loop: 19#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 12#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4#L511-6true assume !true; 5#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 7#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 15#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 19#L510-4true [2019-01-01 21:42:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-01 21:42:09,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2019-01-01 21:42:09,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:09,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:09,284 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 21:42:09,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:09,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:42:09,293 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:42:09,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:42:09,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:42:09,316 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-01 21:42:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:09,326 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 21:42:09,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:42:09,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 21:42:09,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:42:09,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2019-01-01 21:42:09,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:42:09,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:42:09,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-01-01 21:42:09,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:42:09,339 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 21:42:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-01-01 21:42:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 21:42:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:42:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-01 21:42:09,375 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 21:42:09,375 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 21:42:09,376 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:42:09,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-01-01 21:42:09,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:42:09,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:09,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:09,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:42:09,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:09,379 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 52#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 48#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 49#L510-4 [2019-01-01 21:42:09,379 INFO L796 eck$LassoCheckResult]: Loop: 49#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 55#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 44#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 45#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 53#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 46#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 47#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 50#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 49#L510-4 [2019-01-01 21:42:09,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:09,382 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-01-01 21:42:09,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:09,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:09,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:09,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2019-01-01 21:42:09,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:09,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2019-01-01 21:42:09,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:09,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:10,220 WARN L181 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-01 21:42:10,449 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:42:11,238 WARN L181 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-01-01 21:42:11,417 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-01 21:42:11,442 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:11,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:11,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:11,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:11,444 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:11,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:11,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:11,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:11,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:42:11,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:11,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:11,475 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 21:42:11,483 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 21:42:11,487 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 21:42:11,493 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 21:42:11,503 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 21:42:11,512 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 21:42:11,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 21:42:11,554 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 21:42:11,557 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 21:42:11,560 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 21:42:11,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 21:42:11,576 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 21:42:11,580 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 21:42:11,582 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 21:42:11,613 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 21:42:11,633 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 21:42:11,639 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 21:42:12,087 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-01 21:42:12,225 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-01-01 21:42:12,226 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 21:42:12,228 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 21:42:12,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 21:42:13,087 WARN L181 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-01 21:42:13,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:13,298 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:13,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:13,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,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 21:42:13,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:13,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:13,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:13,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:13,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:13,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:13,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:13,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:13,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:13,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:13,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,407 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:42:13,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,426 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:42:13,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:13,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,518 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:42:13,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:42:13,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:13,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:13,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:13,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:13,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,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 21:42:13,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:13,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:13,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:13,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:13,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:13,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:13,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:13,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:13,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:13,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:13,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:13,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:13,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:13,624 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:13,665 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:42:13,665 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:42:13,669 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:13,671 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:13,672 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:13,677 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2019-01-01 21:42:13,746 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:42:13,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:13,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:13,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:14,016 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 21:42:14,020 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:42:14,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:42:14,152 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 5 states. [2019-01-01 21:42:14,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:42:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:42:14,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 21:42:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2019-01-01 21:42:14,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:14,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2019-01-01 21:42:14,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:14,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-01-01 21:42:14,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:14,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2019-01-01 21:42:14,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:42:14,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:42:14,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-01-01 21:42:14,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:14,165 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:42:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-01-01 21:42:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-01 21:42:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:42:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-01 21:42:14,169 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:42:14,169 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:42:14,169 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:42:14,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-01 21:42:14,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:14,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:14,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:14,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:42:14,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:14,172 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 189#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 185#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 186#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 193#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 179#L511-6 [2019-01-01 21:42:14,173 INFO L796 eck$LassoCheckResult]: Loop: 179#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 180#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 190#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 195#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 179#L511-6 [2019-01-01 21:42:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2019-01-01 21:42:14,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:14,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:14,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2019-01-01 21:42:14,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:14,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:14,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2019-01-01 21:42:14,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:14,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:14,411 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-01 21:42:14,905 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-01-01 21:42:15,040 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-01 21:42:15,047 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:15,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:15,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:15,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:15,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:15,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:15,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:15,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:15,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:42:15,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:15,048 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:15,053 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 21:42:15,058 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 21:42:15,665 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-01-01 21:42:15,778 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 21:42:15,783 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 21:42:15,787 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 21:42:15,789 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 21:42:15,792 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 21:42:15,794 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 21:42:15,796 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 21:42:15,799 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 21:42:15,801 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 21:42:15,803 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 21:42:15,807 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 21:42:15,810 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 21:42:15,812 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 21:42:15,815 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 21:42:15,818 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 21:42:15,820 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 21:42:15,823 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 21:42:15,825 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 21:42:16,067 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 21:42:16,823 WARN L181 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 21:42:16,958 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 21:42:17,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:17,077 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:17,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 21:42:17,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:17,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:17,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:17,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:17,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:17,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:17,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:17,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:17,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:17,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:17,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:17,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:17,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:17,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:17,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:17,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:17,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 21:42:17,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:17,094 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:42:17,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:17,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:17,099 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:42:17,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:17,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:17,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:17,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:17,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:17,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:17,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:17,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:17,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:17,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:17,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:17,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:17,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:17,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:17,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:17,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:17,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:17,162 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:17,180 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:42:17,181 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:42:17,181 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:17,182 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:17,182 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:17,184 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2019-01-01 21:42:17,413 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-01-01 21:42:17,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:17,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:17,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:17,605 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 21:42:17,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:42:17,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 21:42:17,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 6 states. [2019-01-01 21:42:17,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:42:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:42:17,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:42:17,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:17,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:42:17,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:17,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:42:17,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:17,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2019-01-01 21:42:17,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:17,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2019-01-01 21:42:17,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:42:17,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:42:17,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2019-01-01 21:42:17,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:17,737 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-01-01 21:42:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2019-01-01 21:42:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-01-01 21:42:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 21:42:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-01 21:42:17,743 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-01 21:42:17,743 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-01 21:42:17,743 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:42:17,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-01-01 21:42:17,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:17,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:17,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:17,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:17,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:17,748 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 379#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 375#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 376#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 385#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 386#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 381#L511-1 assume !strspn_#t~short7; 382#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 373#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 374#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 377#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 388#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 384#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 369#L511-6 [2019-01-01 21:42:17,748 INFO L796 eck$LassoCheckResult]: Loop: 369#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 370#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 380#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 387#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 369#L511-6 [2019-01-01 21:42:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2019-01-01 21:42:17,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:17,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:17,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:17,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:17,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:17,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:42:17,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:42:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:17,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2019-01-01 21:42:17,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:17,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:17,966 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-01 21:42:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:42:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:42:17,999 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:42:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:18,043 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-01-01 21:42:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:42:18,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2019-01-01 21:42:18,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:42:18,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2019-01-01 21:42:18,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:42:18,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:42:18,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2019-01-01 21:42:18,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:18,050 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-01-01 21:42:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2019-01-01 21:42:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-01-01 21:42:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:42:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-01-01 21:42:18,056 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:42:18,056 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:42:18,056 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:42:18,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-01-01 21:42:18,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:42:18,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:18,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:18,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:18,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:18,058 INFO L794 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 450#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 446#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 447#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 456#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 457#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 465#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 462#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 444#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 445#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 448#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 460#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 455#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 440#L511-6 [2019-01-01 21:42:18,058 INFO L796 eck$LassoCheckResult]: Loop: 440#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 441#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 451#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~mem6;havoc strspn_#t~short7;havoc strspn_#t~mem5; 458#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 440#L511-6 [2019-01-01 21:42:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2019-01-01 21:42:18,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:18,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:18,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2019-01-01 21:42:18,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:18,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2019-01-01 21:42:18,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:18,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:18,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:18,389 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-01-01 21:42:19,133 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 133 [2019-01-01 21:42:19,309 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 21:42:19,312 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:19,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:19,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:19,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:19,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:19,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:19,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:19,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:19,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:42:19,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:19,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:19,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 21:42:19,337 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 21:42:19,365 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 21:42:19,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 21:42:19,384 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 21:42:19,390 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 21:42:19,392 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 21:42:19,396 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 21:42:19,398 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 21:42:19,400 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 21:42:19,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 21:42:19,406 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 21:42:19,869 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-01-01 21:42:20,020 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-01 21:42:20,021 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 21:42:20,023 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 21:42:20,024 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 21:42:20,027 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 21:42:20,029 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 21:42:20,031 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 21:42:20,035 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 21:42:20,038 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 21:42:20,860 WARN L181 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 21:42:21,231 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:21,232 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:21,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:21,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:21,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:21,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,305 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:42:21,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,315 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:42:21,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,367 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:42:21,367 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 21:42:21,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,379 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2019-01-01 21:42:21,379 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-01 21:42:21,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:21,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 21:42:21,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,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 21:42:21,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:21,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 21:42:21,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:21,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:21,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:21,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:21,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:21,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:21,483 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:21,554 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:42:21,560 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:42:21,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:21,562 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:21,562 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:21,562 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3 Supporting invariants [] [2019-01-01 21:42:22,416 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2019-01-01 21:42:22,442 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:22,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:22,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:22,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:22,959 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 21:42:22,960 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:42:22,960 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:42:23,020 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2019-01-01 21:42:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:42:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:42:23,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 21:42:23,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:23,026 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:42:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:23,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:23,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:23,119 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 21:42:23,120 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:42:23,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:42:23,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2019-01-01 21:42:23,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:42:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:42:23,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 21:42:23,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:23,191 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:42:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:23,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:23,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:23,453 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 21:42:23,453 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:42:23,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:42:23,508 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 57 transitions. Complement of second has 5 states. [2019-01-01 21:42:23,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:42:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-01 21:42:23,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 21:42:23,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:23,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2019-01-01 21:42:23,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:23,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2019-01-01 21:42:23,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:23,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2019-01-01 21:42:23,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:42:23,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-01-01 21:42:23,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:42:23,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:42:23,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:42:23,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:42:23,517 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:23,517 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:23,517 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:23,517 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:42:23,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:42:23,517 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:42:23,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:42:23,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:42:23 BoogieIcfgContainer [2019-01-01 21:42:23,529 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:42:23,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:42:23,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:42:23,530 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:42:23,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:08" (3/4) ... [2019-01-01 21:42:23,537 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:42:23,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:42:23,538 INFO L168 Benchmark]: Toolchain (without parser) took 15921.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:23,539 INFO L168 Benchmark]: CDTParser took 0.19 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 21:42:23,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:23,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:23,544 INFO L168 Benchmark]: Boogie Preprocessor took 32.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:23,545 INFO L168 Benchmark]: RCFGBuilder took 508.57 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:23,546 INFO L168 Benchmark]: BuchiAutomizer took 14605.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.5 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:23,547 INFO L168 Benchmark]: Witness Printer took 7.52 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:23,552 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.19 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 706.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 508.57 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14605.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.5 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.52 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * a and consists of 4 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 12.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 100 SDtfs, 125 SDslu, 46 SDs, 0 SdLazy, 80 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax100 hnf99 lsp95 ukn80 mio100 lsp39 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf219 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 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...