./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37ce12f320cb92b62d01decbfb4f63ee1143a42a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:20:40,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:20:40,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:20:40,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:20:40,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:20:40,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:20:40,235 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:20:40,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:20:40,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:20:40,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:20:40,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:20:40,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:20:40,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:20:40,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:20:40,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:20:40,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:20:40,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:20:40,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:20:40,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:20:40,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:20:40,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:20:40,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:20:40,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:20:40,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:20:40,262 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:20:40,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:20:40,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:20:40,266 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:20:40,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:20:40,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:20:40,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:20:40,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:20:40,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:20:40,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:20:40,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:20:40,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:20:40,272 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:20:40,289 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:20:40,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:20:40,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:20:40,291 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:20:40,292 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:20:40,292 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:20:40,292 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:20:40,292 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:20:40,292 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:20:40,293 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:20:40,293 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:20:40,293 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:20:40,293 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:20:40,293 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:20:40,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:20:40,295 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:20:40,295 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:20:40,295 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:20:40,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:20:40,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:20:40,296 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:20:40,296 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:20:40,296 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:20:40,297 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:20:40,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:20:40,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:20:40,299 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:20:40,299 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:20:40,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:20:40,300 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:20:40,300 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:20:40,301 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:20:40,301 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2019-01-02 00:20:40,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:20:40,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:20:40,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:20:40,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:20:40,368 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:20:40,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:40,433 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec2bdc2f/74ec370d1eec4a56a88088bd3a146c64/FLAG1ec4d1d76 [2019-01-02 00:20:41,068 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:20:41,069 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:41,086 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec2bdc2f/74ec370d1eec4a56a88088bd3a146c64/FLAG1ec4d1d76 [2019-01-02 00:20:41,258 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec2bdc2f/74ec370d1eec4a56a88088bd3a146c64 [2019-01-02 00:20:41,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:20:41,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:20:41,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:41,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:20:41,275 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:20:41,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:41,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fe4484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41, skipping insertion in model container [2019-01-02 00:20:41,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:41,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:20:41,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:20:41,739 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:41,754 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:20:41,811 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:41,870 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:20:41,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41 WrapperNode [2019-01-02 00:20:41,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:41,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:41,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:20:41,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:20:41,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:41,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:42,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:20:42,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:20:42,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:20:42,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (1/1) ... [2019-01-02 00:20:42,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:20:42,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:20:42,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:20:42,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:20:42,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (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-02 00:20:42,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:20:42,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:20:42,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:20:42,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:20:42,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:20:42,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:20:42,546 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:20:42,547 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:20:42,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:42 BoogieIcfgContainer [2019-01-02 00:20:42,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:20:42,549 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:20:42,552 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:20:42,556 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:20:42,557 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:42,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:20:41" (1/3) ... [2019-01-02 00:20:42,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@622f4bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:42, skipping insertion in model container [2019-01-02 00:20:42,560 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:42,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:41" (2/3) ... [2019-01-02 00:20:42,560 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@622f4bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:42, skipping insertion in model container [2019-01-02 00:20:42,560 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:42,563 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:42" (3/3) ... [2019-01-02 00:20:42,566 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:42,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:20:42,639 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:20:42,639 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:20:42,639 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:20:42,639 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:20:42,640 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:20:42,640 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:20:42,640 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:20:42,640 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:20:42,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-02 00:20:42,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:20:42,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:42,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:42,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:20:42,690 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:42,690 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:20:42,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-02 00:20:42,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:20:42,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:42,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:42,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:20:42,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:42,702 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L555true assume !(main_~length1~0 < 1); 11#L555-2true assume !(main_~length2~0 < 1); 4#L558-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 12#L546-4true [2019-01-02 00:20:42,703 INFO L796 eck$LassoCheckResult]: Loop: 12#L546-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 8#L545-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 9#L546-3true assume !true; 12#L546-4true [2019-01-02 00:20:42,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-02 00:20:42,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2019-01-02 00:20:42,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:42,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:42,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:42,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:42,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:42,935 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-02 00:20:42,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:20:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-02 00:20:42,943 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:20:42,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:20:42,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:20:42,967 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-01-02 00:20:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:20:42,976 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-01-02 00:20:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:20:42,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-01-02 00:20:42,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:20:42,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-01-02 00:20:42,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:20:42,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:20:42,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-02 00:20:42,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:20:42,991 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:20:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-02 00:20:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-02 00:20:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-02 00:20:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-02 00:20:43,027 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:20:43,028 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-02 00:20:43,028 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:20:43,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-02 00:20:43,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:20:43,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:43,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:43,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:20:43,031 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:20:43,031 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 39#L555 assume !(main_~length1~0 < 1); 40#L555-2 assume !(main_~length2~0 < 1); 41#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 42#L546-4 [2019-01-02 00:20:43,032 INFO L796 eck$LassoCheckResult]: Loop: 42#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 43#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 45#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 47#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 42#L546-4 [2019-01-02 00:20:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-02 00:20:43,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:43,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:43,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:43,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2019-01-02 00:20:43,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:43,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:43,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:43,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:20:43,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2019-01-02 00:20:43,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:43,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:43,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:43,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:43,546 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-02 00:20:43,740 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:20:44,604 WARN L181 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-01-02 00:20:44,781 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-02 00:20:44,794 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:44,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:44,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:44,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:44,797 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:44,797 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:44,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:44,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:44,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:20:44,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:44,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:44,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:44,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:44,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:44,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:44,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:44,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:44,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,404 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-01-02 00:20:45,564 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-02 00:20:45,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:45,934 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-02 00:20:46,533 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-02 00:20:46,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:46,733 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:46,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:46,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,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-02 00:20:46,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:46,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:46,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:46,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:46,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:46,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:46,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:46,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:46,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:46,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,858 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:20:46,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,868 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:20:46,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:46,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:46,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:46,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,927 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:20:46,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,931 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:20:46,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:46,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:46,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:46,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:46,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:46,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:46,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:46,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:46,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:46,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:46,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:47,057 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:47,100 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:20:47,104 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:20:47,107 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:47,110 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:47,114 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:47,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrpbrk_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1.offset Supporting invariants [] [2019-01-02 00:20:47,306 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:20:47,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:47,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:47,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:47,511 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-02 00:20:47,515 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-02 00:20:47,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-02 00:20:47,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-01-02 00:20:47,609 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-02 00:20:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:20:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-02 00:20:47,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-02 00:20:47,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:47,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-02 00:20:47,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:47,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-02 00:20:47,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:47,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-02 00:20:47,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:47,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2019-01-02 00:20:47,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:20:47,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:20:47,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-02 00:20:47,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:47,618 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-02 00:20:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-02 00:20:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-02 00:20:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-02 00:20:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-02 00:20:47,620 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-02 00:20:47,620 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-02 00:20:47,620 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:20:47,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-02 00:20:47,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:47,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:47,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:47,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:47,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:47,622 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 153#L555 assume !(main_~length1~0 < 1); 154#L555-2 assume !(main_~length2~0 < 1); 155#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 156#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 157#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 161#L546-3 [2019-01-02 00:20:47,622 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 164#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 160#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 161#L546-3 [2019-01-02 00:20:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:47,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-01-02 00:20:47,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:47,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:47,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:47,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:47,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2019-01-02 00:20:47,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:47,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:47,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:47,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:47,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2019-01-02 00:20:47,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:47,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:48,286 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2019-01-02 00:20:48,412 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-02 00:20:48,418 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:48,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:48,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:48,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:48,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:48,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:48,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:48,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:48,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:20:48,421 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:48,421 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:48,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:48,820 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-01-02 00:20:49,021 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-02 00:20:49,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:49,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:49,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:49,966 WARN L181 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-02 00:20:50,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:50,175 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:50,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:50,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:50,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:50,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:50,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:50,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:50,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:50,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:20:50,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:50,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,276 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:20:50,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,283 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:20:50,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:50,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:50,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:50,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:50,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:50,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:50,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:50,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:50,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:50,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:50,397 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:20:50,404 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-02 00:20:50,404 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:50,405 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:50,405 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:50,406 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2019-01-02 00:20:50,620 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-02 00:20:50,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:50,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:50,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:50,817 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-02 00:20:50,818 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-02 00:20:50,818 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-02 00:20:50,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 5 states. [2019-01-02 00:20:50,836 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-02 00:20:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:20:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-02 00:20:50,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-02 00:20:50,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:50,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-02 00:20:50,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:50,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-02 00:20:50,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:50,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-01-02 00:20:50,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:50,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-01-02 00:20:50,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:20:50,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-02 00:20:50,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-01-02 00:20:50,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:50,845 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-02 00:20:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-01-02 00:20:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2019-01-02 00:20:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-02 00:20:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-02 00:20:50,847 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-02 00:20:50,847 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-02 00:20:50,848 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:20:50,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-02 00:20:50,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:50,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:50,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:50,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:50,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:50,851 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 300#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 301#L555 assume !(main_~length1~0 < 1); 302#L555-2 assume !(main_~length2~0 < 1); 303#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 304#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 305#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 312#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 314#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 306#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 307#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 310#L546-3 [2019-01-02 00:20:50,852 INFO L796 eck$LassoCheckResult]: Loop: 310#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 309#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 310#L546-3 [2019-01-02 00:20:50,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:50,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2019-01-02 00:20:50,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:50,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2019-01-02 00:20:50,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:20:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:50,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2019-01-02 00:20:50,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:50,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:50,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:20:50,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:20:51,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:20:51,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:20:51,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:51,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:51,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2019-01-02 00:20:51,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-02 00:20:51,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:20:51,810 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-02 00:20:52,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2019-01-02 00:20:52,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-02 00:20:52,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-02 00:20:52,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:20:52,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:20:52,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-02 00:20:52,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-01-02 00:20:56,773 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-02 00:20:59,774 WARN L181 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-02 00:20:59,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-02 00:20:59,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2019-01-02 00:20:59,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:20:59,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:20:59,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:20:59,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2019-01-02 00:20:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:20:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:20:59,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-01-02 00:20:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-02 00:20:59,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2019-01-02 00:20:59,888 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2019-01-02 00:21:04,077 WARN L181 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-02 00:21:08,486 WARN L181 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-01-02 00:21:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:08,616 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-02 00:21:08,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-02 00:21:08,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-01-02 00:21:08,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:08,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2019-01-02 00:21:08,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-02 00:21:08,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-02 00:21:08,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-02 00:21:08,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:08,622 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-02 00:21:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-02 00:21:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2019-01-02 00:21:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:21:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-02 00:21:08,625 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-02 00:21:08,625 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-02 00:21:08,625 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:21:08,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-02 00:21:08,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:08,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:08,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:08,628 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:08,628 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:21:08,628 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 412#L555 assume !(main_~length1~0 < 1); 413#L555-2 assume !(main_~length2~0 < 1); 414#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 415#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 416#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 426#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 425#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 421#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 422#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 427#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 417#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 418#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~mem3;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 420#L546-3 [2019-01-02 00:21:08,628 INFO L796 eck$LassoCheckResult]: Loop: 420#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 424#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 419#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 420#L546-3 [2019-01-02 00:21:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2019-01-02 00:21:08,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:08,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:08,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:08,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2019-01-02 00:21:08,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:08,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2019-01-02 00:21:08,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,957 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-02 00:21:09,165 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-02 00:21:10,417 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 192 DAG size of output: 163 [2019-01-02 00:21:10,631 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-02 00:21:10,633 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:10,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:10,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:10,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:10,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:10,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:10,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:10,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:10,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-02 00:21:10,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:10,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:10,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:10,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:11,277 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-01-02 00:21:11,427 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-02 00:21:11,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-02 00:21:11,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:11,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:11,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:11,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:11,813 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-02 00:21:12,614 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-02 00:21:13,408 WARN L181 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-02 00:21:13,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:13,459 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:13,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-02 00:21:13,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,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-02 00:21:13,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,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-02 00:21:13,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:21:13,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:21:13,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:21:13,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:21:13,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:13,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,578 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:13,615 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-02 00:21:13,615 INFO L444 ModelExtractionUtils]: 42 out of 52 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-02 00:21:13,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:13,618 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:13,619 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:13,619 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2019-01-02 00:21:13,840 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2019-01-02 00:21:13,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:13,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:13,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:13,917 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-02 00:21:13,918 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-02 00:21:13,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-02 00:21:13,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2019-01-02 00:21:13,945 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-02 00:21:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-02 00:21:13,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:21:13,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:13,946 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:14,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:14,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:14,053 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-02 00:21:14,054 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-02 00:21:14,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-02 00:21:14,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-01-02 00:21:14,080 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-02 00:21:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-02 00:21:14,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:21:14,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:14,081 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:14,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:14,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:14,164 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-02 00:21:14,164 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-02 00:21:14,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-02 00:21:14,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-01-02 00:21:14,185 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-02 00:21:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-01-02 00:21:14,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:21:14,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:14,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-02 00:21:14,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:14,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-02 00:21:14,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:14,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-01-02 00:21:14,190 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:14,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-02 00:21:14,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:21:14,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:21:14,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:21:14,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:14,191 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:14,191 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:14,191 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:14,191 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:21:14,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:21:14,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:14,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:21:14,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:21:14 BoogieIcfgContainer [2019-01-02 00:21:14,206 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:21:14,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:21:14,206 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:21:14,206 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:21:14,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:42" (3/4) ... [2019-01-02 00:21:14,211 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:21:14,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:21:14,213 INFO L168 Benchmark]: Toolchain (without parser) took 32947.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 943.3 MB in the beginning and 1.0 GB in the end (delta: -72.0 MB). Peak memory consumption was 240.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:14,215 INFO L168 Benchmark]: CDTParser took 0.18 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-02 00:21:14,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.07 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:14,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:14,218 INFO L168 Benchmark]: Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:14,218 INFO L168 Benchmark]: RCFGBuilder took 505.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:14,220 INFO L168 Benchmark]: BuchiAutomizer took 31657.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.9 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:14,220 INFO L168 Benchmark]: Witness Printer took 5.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:14,225 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.18 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 603.07 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 505.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31657.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.9 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 21.7s. Construction of modules took 0.2s. Büchi inclusion checks took 9.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 93 SDtfs, 80 SDslu, 56 SDs, 0 SdLazy, 91 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax100 hnf99 lsp96 ukn81 mio100 lsp41 div100 bol100 ite100 ukn100 eq188 hnf87 smp98 dnf308 smp88 tf100 neg94 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...