./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c --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-crafted-lit/cstrspn_true-termination_true-no-overflow.c -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 0c74f0cc26425c1a044a70e86941b5dd82b132ff ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:07,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:35:07,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:35:07,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:35:07,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:35:07,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:35:07,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:35:07,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:35:07,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:35:07,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:35:07,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:35:07,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:35:07,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:35:07,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:35:07,532 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:35:07,533 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:35:07,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:35:07,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:35:07,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:35:07,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:35:07,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:35:07,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:35:07,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:35:07,559 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:35:07,559 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:35:07,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:35:07,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:35:07,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:35:07,569 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:35:07,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:35:07,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:35:07,574 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:35:07,574 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:35:07,574 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:35:07,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:35:07,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:35:07,580 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:35:07,612 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:35:07,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:35:07,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:35:07,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:35:07,614 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:35:07,615 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:35:07,615 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:35:07,615 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:35:07,616 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:35:07,616 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:35:07,616 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:35:07,616 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:35:07,616 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:35:07,616 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:35:07,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:35:07,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:35:07,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:35:07,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:35:07,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:35:07,619 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:35:07,619 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:35:07,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:35:07,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:35:07,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:35:07,622 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:35:07,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:35:07,622 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:35:07,623 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:35:07,624 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:35:07,625 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 -> 0c74f0cc26425c1a044a70e86941b5dd82b132ff [2019-01-01 21:35:07,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:35:07,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:35:07,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:35:07,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:35:07,708 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:35:07,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2019-01-01 21:35:07,773 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8d4601b/b6bbbd60d56c44b2858de991f64253c6/FLAG483b779ff [2019-01-01 21:35:08,297 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:35:08,298 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2019-01-01 21:35:08,305 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8d4601b/b6bbbd60d56c44b2858de991f64253c6/FLAG483b779ff [2019-01-01 21:35:08,625 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8d4601b/b6bbbd60d56c44b2858de991f64253c6 [2019-01-01 21:35:08,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:35:08,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:35:08,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:08,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:35:08,635 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:35:08,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:08,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7f6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08, skipping insertion in model container [2019-01-01 21:35:08,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:08,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:35:08,673 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:35:08,868 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:08,887 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:35:08,918 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:08,942 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:35:08,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08 WrapperNode [2019-01-01 21:35:08,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:08,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:08,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:35:08,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:35:08,953 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:35:08" (1/1) ... [2019-01-01 21:35:08,963 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:35:08" (1/1) ... [2019-01-01 21:35:08,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:08,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:35:08,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:35:08,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:35:08,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:08,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:09,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:09,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:09,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:09,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:09,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (1/1) ... [2019-01-01 21:35:09,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:35:09,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:35:09,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:35:09,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:35:09,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35: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:35:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:35:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:35:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:35:09,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:35:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:35:09,622 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:35:09,623 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-01 21:35:09,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:09 BoogieIcfgContainer [2019-01-01 21:35:09,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:35:09,624 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:35:09,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:35:09,633 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:35:09,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:09,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:35:08" (1/3) ... [2019-01-01 21:35:09,636 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675973f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:09, skipping insertion in model container [2019-01-01 21:35:09,636 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:09,636 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:08" (2/3) ... [2019-01-01 21:35:09,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675973f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:09, skipping insertion in model container [2019-01-01 21:35:09,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:09,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:09" (3/3) ... [2019-01-01 21:35:09,640 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_true-termination_true-no-overflow.c [2019-01-01 21:35:09,704 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:35:09,704 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:35:09,704 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:35:09,705 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:35:09,705 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:35:09,706 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:35:09,706 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:35:09,706 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:35:09,706 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:35:09,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:35:09,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:09,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:09,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:09,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:09,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:35:09,760 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:35:09,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:35:09,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:09,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:09,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:09,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:09,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:35:09,773 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 19#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L31-4true [2019-01-01 21:35:09,773 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 23#L36true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 6#L31-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L31-4true [2019-01-01 21:35:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2019-01-01 21:35:09,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:09,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:09,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:09,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2019-01-01 21:35:09,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:09,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:09,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:09,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:10,012 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:35:10,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:35:10,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:35:10,019 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:35:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:35:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:35:10,037 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-01 21:35:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:35:10,046 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-01-01 21:35:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:35:10,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-01-01 21:35:10,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:10,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2019-01-01 21:35:10,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:35:10,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:35:10,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-01 21:35:10,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:10,058 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:35:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-01 21:35:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 21:35:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:35:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-01 21:35:10,090 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:35:10,091 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:35:10,091 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:35:10,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-01 21:35:10,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:10,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:10,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:10,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:10,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:10,093 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 50#L31-4 [2019-01-01 21:35:10,093 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 57#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 61#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 52#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 50#L31-4 [2019-01-01 21:35:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2019-01-01 21:35:10,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:10,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:10,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2019-01-01 21:35:10,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:10,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:10,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2019-01-01 21:35:10,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:10,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:10,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:10,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:10,805 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 2 [2019-01-01 21:35:10,820 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:35:10,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:35:10,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:35:11,407 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-01 21:35:12,059 WARN L181 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-01 21:35:12,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:35:12,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:35:12,062 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-01 21:35:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:35:12,341 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-01 21:35:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:35:12,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2019-01-01 21:35:12,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:35:12,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2019-01-01 21:35:12,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-01-01 21:35:12,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 21:35:12,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2019-01-01 21:35:12,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:12,347 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-01 21:35:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2019-01-01 21:35:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-01-01 21:35:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:35:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-01 21:35:12,351 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:35:12,351 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:35:12,351 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:35:12,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-01-01 21:35:12,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:35:12,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:12,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:12,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:12,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:12,354 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 126#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 142#L31-4 [2019-01-01 21:35:12,354 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 124#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 125#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 138#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 139#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 144#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 143#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 142#L31-4 [2019-01-01 21:35:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2019-01-01 21:35:12,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:12,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:12,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:12,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:12,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:12,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:12,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2019-01-01 21:35:12,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:12,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:12,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:12,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:12,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2019-01-01 21:35:12,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:12,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:12,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:12,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:12,747 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-01 21:35:13,083 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-01 21:35:13,561 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-01-01 21:35:13,714 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 21:35:13,726 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:13,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:13,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:13,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:13,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:13,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:13,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:13,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:13,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-01 21:35:13,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:13,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:13,754 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:35:13,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:13,769 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:35:14,236 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-01-01 21:35:14,481 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-01 21:35:14,481 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:35:14,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:35:14,485 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:35:14,488 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:35:14,490 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:35:14,495 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:35:14,497 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:35:14,498 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:35:14,501 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:35:14,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:35:14,506 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:35:14,508 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:35:14,510 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:35:14,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:35:15,014 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-01 21:35:15,544 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:35:15,598 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:15,605 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:15,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:15,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:15,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:15,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:15,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:15,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:15,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:15,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:15,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:15,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:15,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:15,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:15,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:15,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:15,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:15,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:15,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:15,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:15,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:15,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:15,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:15,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:15,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:15,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:15,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:15,661 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:15,690 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:35:15,690 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:35:15,693 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:15,695 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:35:15,696 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:15,696 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2019-01-01 21:35:15,760 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-01-01 21:35:15,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:35:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:15,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:15,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:15,887 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:35:15,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:35:15,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:35:16,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2019-01-01 21:35:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-01-01 21:35:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2019-01-01 21:35:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2019-01-01 21:35:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2019-01-01 21:35:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:16,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2019-01-01 21:35:16,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:16,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2019-01-01 21:35:16,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:35:16,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:35:16,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2019-01-01 21:35:16,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:35:16,045 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:35:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2019-01-01 21:35:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-01 21:35:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:35:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-01 21:35:16,050 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:35:16,050 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:35:16,050 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:35:16,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-01-01 21:35:16,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:16,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:16,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:16,052 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:16,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:16,052 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 304#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 297#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 290#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 292#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 298#L34-5 [2019-01-01 21:35:16,052 INFO L796 eck$LassoCheckResult]: Loop: 298#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 299#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 305#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 298#L34-5 [2019-01-01 21:35:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2019-01-01 21:35:16,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:16,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:16,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:16,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:16,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2019-01-01 21:35:16,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:16,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:16,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:16,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:16,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2019-01-01 21:35:16,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:16,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:16,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:16,397 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:35:16,540 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:35:17,066 WARN L181 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2019-01-01 21:35:17,334 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-01-01 21:35:17,336 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:17,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:17,336 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:17,336 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:17,337 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:17,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:17,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:17,337 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:17,337 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:35:17,337 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:17,337 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:17,344 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:35:17,379 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:35:17,408 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:35:17,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:17,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:17,415 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:35:17,419 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:35:17,421 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:35:17,424 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:35:17,426 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:35:17,428 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:35:17,431 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:35:17,434 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:35:17,437 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:35:17,439 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:35:17,442 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:35:17,445 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:35:17,805 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-01-01 21:35:17,973 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-01-01 21:35:18,508 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-01-01 21:35:19,072 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 21:35:19,333 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 21:35:19,442 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:19,442 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:19,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:35:19,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:19,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,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:35:19,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:19,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:19,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:19,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:19,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:19,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,486 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:35:19,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,495 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:35:19,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:19,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:19,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,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:35:19,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:19,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:19,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:19,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,589 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:35:19,589 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 21:35:19,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,619 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-01 21:35:19,620 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 21:35:19,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:19,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:19,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:19,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:19,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:19,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:19,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:19,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:19,817 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:19,856 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:35:19,856 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:35:19,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:19,860 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:35:19,861 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:19,861 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-01 21:35:20,151 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:35:20,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:35:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:20,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:20,392 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:35:20,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-01 21:35:20,393 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-01 21:35:20,485 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2019-01-01 21:35:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:35:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 21:35:20,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:35:20,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:20,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 21:35:20,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:20,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:35:20,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:20,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2019-01-01 21:35:20,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:20,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2019-01-01 21:35:20,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:35:20,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:35:20,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-01-01 21:35:20,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:35:20,498 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-01 21:35:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-01-01 21:35:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-01-01 21:35:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:35:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-01-01 21:35:20,501 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:35:20,501 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:35:20,501 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:35:20,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-01-01 21:35:20,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:20,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:20,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:20,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:20,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:20,503 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 497#L14 assume !(build_nondet_String_~length~0 < 1); 500#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 490#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 491#L14-3 assume !(build_nondet_String_~length~0 < 1); 493#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 485#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 477#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 478#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 492#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 499#L34-1 assume !cstrspn_#t~short7; 495#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 482#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 483#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 484#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 479#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 481#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 486#L34-5 [2019-01-01 21:35:20,504 INFO L796 eck$LassoCheckResult]: Loop: 486#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 487#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 494#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 486#L34-5 [2019-01-01 21:35:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:20,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2019-01-01 21:35:20,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:20,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:20,810 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:35:20,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:35:20,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:35:20,811 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:35:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2019-01-01 21:35:20,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:20,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:20,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:20,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:20,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:20,935 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:35:21,098 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:35:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:35:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:35:21,099 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-01-01 21:35:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:35:21,428 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-01 21:35:21,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:35:21,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-01-01 21:35:21,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:21,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2019-01-01 21:35:21,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:35:21,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:35:21,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-01-01 21:35:21,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:35:21,433 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:35:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-01-01 21:35:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-01 21:35:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:35:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-01 21:35:21,436 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:35:21,436 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:35:21,436 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:35:21,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-01-01 21:35:21,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:21,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:21,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:21,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:21,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:21,440 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 568#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 569#L14 assume !(build_nondet_String_~length~0 < 1); 576#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 565#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 566#L14-3 assume !(build_nondet_String_~length~0 < 1); 567#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 560#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 552#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 553#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 572#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 574#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 575#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 557#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 558#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 559#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 554#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 556#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 561#L34-5 [2019-01-01 21:35:21,440 INFO L796 eck$LassoCheckResult]: Loop: 561#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 562#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 570#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 561#L34-5 [2019-01-01 21:35:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:21,441 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2019-01-01 21:35:21,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:21,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:21,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2019-01-01 21:35:21,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:21,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2019-01-01 21:35:21,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:21,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:21,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:21,849 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:35:21,990 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:35:22,904 WARN L181 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 156 [2019-01-01 21:35:24,060 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-01-01 21:35:24,065 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:24,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:24,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:24,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:24,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:24,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:24,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:24,066 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:24,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2019-01-01 21:35:24,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:24,066 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:24,077 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:35:24,103 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:35:24,105 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:35:24,107 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:35:24,110 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:35:24,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:24,117 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:35:24,119 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:35:24,122 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:35:24,125 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:35:24,127 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:35:24,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:24,130 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:35:24,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:35:25,230 WARN L181 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-01-01 21:35:25,360 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-01 21:35:25,360 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:35:25,368 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:35:25,370 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:35:25,371 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:35:26,357 WARN L181 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 130 [2019-01-01 21:35:26,473 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-01 21:35:26,548 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:35:36,681 WARN L181 SmtUtils]: Spent 10.03 s on a formula simplification. DAG size of input: 187 DAG size of output: 134 [2019-01-01 21:35:37,630 WARN L181 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-01 21:35:37,667 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:37,668 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:37,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:37,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:37,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:37,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:37,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:37,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:37,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:37,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:37,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:37,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:37,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:37,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:37,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:37,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:37,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:37,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:37,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:37,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:37,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:37,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:37,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:37,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:37,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:37,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:35:37,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:37,759 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 21:35:37,759 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 21:35:37,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:38,116 INFO L402 nArgumentSynthesizer]: We have 276 Motzkin's Theorem applications. [2019-01-01 21:35:38,117 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 21:35:42,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:45,669 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 21:35:45,670 INFO L444 ModelExtractionUtils]: 401 out of 417 variables were initially zero. Simplification set additionally 13 variables to zero. [2019-01-01 21:35:45,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:45,677 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2019-01-01 21:35:45,678 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:45,679 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-01 21:35:45,979 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-01-01 21:35:45,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:35:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:46,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:46,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:46,076 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:35:46,077 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:35:46,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:35:46,112 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 43 states and 48 transitions. Complement of second has 5 states. [2019-01-01 21:35:46,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-01 21:35:46,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:35:46,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:46,118 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:35:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:46,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:46,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:46,179 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:35:46,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:35:46,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:35:46,198 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 43 states and 48 transitions. Complement of second has 5 states. [2019-01-01 21:35:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-01 21:35:46,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:35:46,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:46,201 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:35:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:46,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:46,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:46,273 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:35:46,273 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:35:46,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:35:46,301 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 4 states. [2019-01-01 21:35:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-01 21:35:46,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:35:46,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:46,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:35:46,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:46,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 21:35:46,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:46,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2019-01-01 21:35:46,309 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:46,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2019-01-01 21:35:46,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:35:46,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:35:46,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:35:46,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:46,310 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:46,310 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:46,310 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:46,310 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:35:46,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:35:46,311 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:46,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:35:46,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:35:46 BoogieIcfgContainer [2019-01-01 21:35:46,320 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:35:46,321 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:35:46,321 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:35:46,321 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:35:46,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:09" (3/4) ... [2019-01-01 21:35:46,325 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:35:46,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:35:46,326 INFO L168 Benchmark]: Toolchain (without parser) took 37696.26 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 749.7 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -311.5 MB). Peak memory consumption was 438.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:46,327 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:46,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:46,330 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.98 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:46,330 INFO L168 Benchmark]: Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:46,331 INFO L168 Benchmark]: RCFGBuilder took 596.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:46,332 INFO L168 Benchmark]: BuchiAutomizer took 36696.33 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 643.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.4 MB). Peak memory consumption was 458.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:46,333 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:46,340 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.98 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 596.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 36696.33 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 643.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.4 MB). Peak memory consumption was 458.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.38 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 34.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 138 SDtfs, 138 SDslu, 119 SDs, 0 SdLazy, 177 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital377 mio100 ax100 hnf99 lsp92 ukn70 mio100 lsp63 div115 bol100 ite100 ukn100 eq177 hnf86 smp80 dnf1711 smp46 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 7922ms VariablesStem: 33 VariablesLoop: 16 DisjunctsStem: 16 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 276 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...