./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/substring-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/substring-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 0116566dfd4e4e63b59200ee97d098541aa6c54d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:11,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:21:11,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:21:11,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:21:11,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:21:11,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:21:11,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:21:11,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:21:11,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:21:11,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:21:11,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:21:11,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:21:11,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:21:11,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:21:11,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:21:11,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:21:11,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:21:11,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:21:11,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:21:11,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:21:11,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:21:11,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:21:11,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:21:11,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:21:11,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:21:11,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:21:11,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:21:11,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:21:11,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:21:11,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:21:11,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:21:11,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:21:11,484 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:21:11,484 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:21:11,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:21:11,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:21:11,487 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:21:11,504 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:21:11,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:21:11,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:21:11,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:21:11,506 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:21:11,506 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:21:11,506 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:21:11,506 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:21:11,507 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:21:11,507 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:21:11,507 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:21:11,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:21:11,507 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:21:11,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:21:11,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:21:11,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:21:11,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:21:11,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:21:11,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:21:11,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:21:11,509 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:21:11,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:21:11,509 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:21:11,509 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:21:11,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:21:11,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:21:11,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:21:11,510 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:21:11,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:21:11,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:21:11,510 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:21:11,511 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:21:11,512 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 -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2019-01-02 00:21:11,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:21:11,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:21:11,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:21:11,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:21:11,565 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:21:11,566 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:11,625 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6ff30d8/4fe5a95af2dd4957813eef6177d9c111/FLAG327b924a4 [2019-01-02 00:21:12,193 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:21:12,194 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:12,215 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6ff30d8/4fe5a95af2dd4957813eef6177d9c111/FLAG327b924a4 [2019-01-02 00:21:12,453 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6ff30d8/4fe5a95af2dd4957813eef6177d9c111 [2019-01-02 00:21:12,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:21:12,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:21:12,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:12,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:21:12,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:21:12,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:12" (1/1) ... [2019-01-02 00:21:12,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2da7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:12, skipping insertion in model container [2019-01-02 00:21:12,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:12" (1/1) ... [2019-01-02 00:21:12,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:21:12,543 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:21:12,899 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:12,917 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:21:12,969 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:13,116 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:21:13,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13 WrapperNode [2019-01-02 00:21:13,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:13,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:13,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:21:13,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:21:13,128 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:21:13" (1/1) ... [2019-01-02 00:21:13,145 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:21:13" (1/1) ... [2019-01-02 00:21:13,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:13,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:21:13,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:21:13,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:21:13,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (1/1) ... [2019-01-02 00:21:13,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (1/1) ... [2019-01-02 00:21:13,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (1/1) ... [2019-01-02 00:21:13,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (1/1) ... [2019-01-02 00:21:13,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (1/1) ... [2019-01-02 00:21:13,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (1/1) ... [2019-01-02 00:21:13,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (1/1) ... [2019-01-02 00:21:13,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:21:13,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:21:13,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:21:13,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:21:13,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (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:21:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:21:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:21:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:21:13,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:21:13,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:21:13,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:21:13,685 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:21:13,685 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:21:13,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:13 BoogieIcfgContainer [2019-01-02 00:21:13,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:21:13,687 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:21:13,687 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:21:13,692 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:21:13,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:13,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:21:12" (1/3) ... [2019-01-02 00:21:13,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f99062a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:13, skipping insertion in model container [2019-01-02 00:21:13,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:13,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:13" (2/3) ... [2019-01-02 00:21:13,696 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f99062a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:13, skipping insertion in model container [2019-01-02 00:21:13,696 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:13,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:13" (3/3) ... [2019-01-02 00:21:13,698 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:13,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:21:13,757 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:21:13,757 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:21:13,758 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:21:13,758 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:21:13,758 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:21:13,759 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:21:13,759 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:21:13,759 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:21:13,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-02 00:21:13,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-02 00:21:13,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:13,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:13,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:13,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:13,808 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:21:13,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-02 00:21:13,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-02 00:21:13,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:13,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:13,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:13,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:13,822 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L558true assume !(main_~length1~0 < 1); 5#L558-2true assume !(main_~length2~0 < 1); 18#L561-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.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);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 13#L543-3true [2019-01-02 00:21:13,822 INFO L796 eck$LassoCheckResult]: Loop: 13#L543-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 10#L543-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 12#L546-5true assume !true; 14#L546-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 16#L550true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 13#L543-3true [2019-01-02 00:21:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-02 00:21:13,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:13,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:13,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2019-01-02 00:21:13,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:13,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:14,035 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,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:21:14,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:21:14,042 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:21:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:21:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:21:14,065 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-02 00:21:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:14,073 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-01-02 00:21:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:21:14,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-02 00:21:14,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-02 00:21:14,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2019-01-02 00:21:14,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-02 00:21:14,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-02 00:21:14,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-02 00:21:14,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:14,084 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-02 00:21:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-02 00:21:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-02 00:21:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-02 00:21:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-02 00:21:14,111 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-02 00:21:14,112 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-02 00:21:14,112 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:21:14,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-02 00:21:14,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-02 00:21:14,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:14,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:14,113 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:14,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:14,114 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 43#L558 assume !(main_~length1~0 < 1); 44#L558-2 assume !(main_~length2~0 < 1); 51#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.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);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 52#L543-3 [2019-01-02 00:21:14,114 INFO L796 eck$LassoCheckResult]: Loop: 52#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 45#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 46#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 48#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L546-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 49#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 50#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 52#L543-3 [2019-01-02 00:21:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-02 00:21:14,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:14,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:14,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2019-01-02 00:21:14,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:14,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2019-01-02 00:21:14,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:14,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:14,873 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-02 00:21:15,018 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-02 00:21:15,768 WARN L181 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-02 00:21:15,977 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-02 00:21:15,989 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:15,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:15,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:15,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:15,991 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:15,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:15,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:15,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:15,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:21:15,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:15,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:16,019 INFO 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:16,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:21:16,551 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-02 00:21:16,730 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-02 00:21:16,731 INFO 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:16,737 INFO 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:16,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:16,742 INFO 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:16,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:16,748 INFO 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:16,751 INFO 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:16,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:16,758 INFO 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:16,760 INFO 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:16,762 INFO 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:16,766 INFO 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:16,768 INFO 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:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:16,776 INFO 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:16,779 INFO 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:16,781 INFO 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:16,784 INFO 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:17,360 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-02 00:21:17,849 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-02 00:21:18,005 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:18,011 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:18,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:18,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:18,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:18,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:18,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:18,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:18,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:18,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:18,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:18,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:18,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:18,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:18,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:18,022 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-02 00:21:18,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:18,027 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:21:18,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:18,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:18,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:18,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:18,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:18,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:18,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:18,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:18,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:18,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:18,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:18,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:18,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:18,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:18,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:18,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:18,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:18,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:18,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:18,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:18,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:18,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:18,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:18,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:18,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:18,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:18,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:18,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:18,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:18,067 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:21:18,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:18,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:18,080 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:21:18,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:18,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:18,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:18,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:18,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:18,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:18,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:18,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:18,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:18,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:18,250 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:21:18,250 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:21:18,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:18,256 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:18,256 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:18,257 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2019-01-02 00:21:18,409 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:21:18,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:18,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:18,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:18,552 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:18,555 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:18,556 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-02 00:21:18,664 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2019-01-02 00:21:18,665 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:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-02 00:21:18,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2019-01-02 00:21:18,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2019-01-02 00:21:18,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-02 00:21:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:18,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-02 00:21:18,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:18,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2019-01-02 00:21:18,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:21:18,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:21:18,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-01-02 00:21:18,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:18,675 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-02 00:21:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-01-02 00:21:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-02 00:21:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:21:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-01-02 00:21:18,677 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-02 00:21:18,677 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-02 00:21:18,677 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:21:18,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-01-02 00:21:18,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:18,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:18,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:18,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:18,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:21:18,679 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 171#L558 assume !(main_~length1~0 < 1); 172#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.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);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 182#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 173#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 174#L546-5 [2019-01-02 00:21:18,679 INFO L796 eck$LassoCheckResult]: Loop: 174#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 178#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 174#L546-5 [2019-01-02 00:21:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-01-02 00:21:18,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:18,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:18,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:18,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:18,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2019-01-02 00:21:18,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:18,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2019-01-02 00:21:18,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:18,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:18,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:19,023 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-02 00:21:19,450 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-01-02 00:21:19,620 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-02 00:21:19,624 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:19,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:19,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:19,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:19,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:19,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:19,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:19,625 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:19,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:21:19,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:19,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:19,630 INFO 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:19,643 INFO 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:19,645 INFO 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:19,649 INFO 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:19,655 INFO 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:19,657 INFO 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:19,659 INFO 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:19,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:19,664 INFO 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:19,666 INFO 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:19,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:19,673 INFO 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:19,679 INFO 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:19,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:19,686 INFO 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:19,688 INFO 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:19,690 INFO 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:19,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:19,697 INFO 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:20,265 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-02 00:21:20,470 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-01-02 00:21:20,470 INFO 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:20,473 INFO 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:20,744 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-02 00:21:21,926 WARN L181 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-02 00:21:21,963 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:21,963 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:21,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:21,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:21,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:21,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:21,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:21,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:21,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:21,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:21,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:21,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:21,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:21,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:21,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:21,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:21,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:21,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:21,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:21,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:22,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:22,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:22,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:22,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:22,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:22,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:22,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:22,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:22,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:22,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:22,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:22,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:22,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:22,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:22,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:22,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:22,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:22,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:22,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:22,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:22,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:22,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:22,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:22,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:22,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:22,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:22,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:22,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:22,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:22,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:22,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:22,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:22,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:22,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:22,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:22,086 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:22,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:21:22,112 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:21:22,112 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:22,113 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:22,114 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:22,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2019-01-02 00:21:22,521 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2019-01-02 00:21:22,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:22,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:22,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:22,736 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:22,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:21:22,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-02 00:21:22,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 59 states and 76 transitions. Complement of second has 8 states. [2019-01-02 00:21:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:21:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-02 00:21:22,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-02 00:21:22,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:22,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-02 00:21:22,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:22,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-02 00:21:22,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:22,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2019-01-02 00:21:22,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:21:22,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2019-01-02 00:21:22,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-02 00:21:22,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-02 00:21:22,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-01-02 00:21:22,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:22,838 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-01-02 00:21:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-01-02 00:21:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-01-02 00:21:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-02 00:21:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-01-02 00:21:22,845 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-02 00:21:22,845 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-02 00:21:22,845 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:21:22,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2019-01-02 00:21:22,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:21:22,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:22,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:22,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:22,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:21:22,847 INFO L794 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 401#L558 assume !(main_~length1~0 < 1); 406#L558-2 assume !(main_~length2~0 < 1); 412#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.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);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 415#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 402#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 403#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2019-01-02 00:21:22,847 INFO L796 eck$LassoCheckResult]: Loop: 409#L546-1 assume !substring_#t~short6; 419#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 408#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 409#L546-1 [2019-01-02 00:21:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2019-01-02 00:21:22,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:22,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2019-01-02 00:21:22,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:22,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:22,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:22,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:22,948 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:22,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:21:22,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:21:22,949 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:21:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:21:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:21:22,950 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-02 00:21:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:22,994 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-01-02 00:21:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:21:22,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-01-02 00:21:22,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:22,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2019-01-02 00:21:22,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:21:22,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:21:22,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-01-02 00:21:22,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:22,998 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-02 00:21:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-01-02 00:21:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-02 00:21:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:21:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-02 00:21:23,001 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-02 00:21:23,001 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-02 00:21:23,001 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:21:23,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-02 00:21:23,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:23,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:23,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:23,003 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:23,003 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:21:23,003 INFO L794 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 479#L558 assume !(main_~length1~0 < 1); 484#L558-2 assume !(main_~length2~0 < 1); 494#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.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);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 489#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 482#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 483#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 496#L546-1 assume !substring_#t~short6; 497#L546-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 492#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 493#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 490#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 480#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 481#L546-5 [2019-01-02 00:21:23,003 INFO L796 eck$LassoCheckResult]: Loop: 481#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 486#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 495#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 481#L546-5 [2019-01-02 00:21:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2019-01-02 00:21:23,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:23,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:21:23,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:21:23,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:21:23,103 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:21:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2019-01-02 00:21:23,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:23,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:23,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,386 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-02 00:21:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:21:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:21:23,419 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-02 00:21:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:23,459 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-01-02 00:21:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:21:23,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-01-02 00:21:23,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:23,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2019-01-02 00:21:23,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:21:23,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:21:23,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-01-02 00:21:23,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:23,462 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-02 00:21:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-01-02 00:21:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-02 00:21:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:21:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-02 00:21:23,464 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-02 00:21:23,464 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-02 00:21:23,465 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:21:23,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-01-02 00:21:23,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:21:23,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:23,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:23,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:23,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:21:23,466 INFO L794 eck$LassoCheckResult]: Stem: 544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 538#L558 assume !(main_~length1~0 < 1); 543#L558-2 assume !(main_~length2~0 < 1); 547#L561-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.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);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 548#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 549#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 557#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 554#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 555#L546-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6; 551#L546-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 552#L550 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 550#L543-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 539#L543-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 540#L546-5 [2019-01-02 00:21:23,466 INFO L796 eck$LassoCheckResult]: Loop: 540#L546-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 545#L546-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 553#L546-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 540#L546-5 [2019-01-02 00:21:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2019-01-02 00:21:23,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:23,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:23,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:23,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2019-01-02 00:21:23,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2019-01-02 00:21:23,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:23,973 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-02 00:21:24,723 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 146 [2019-01-02 00:21:24,976 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-02 00:21:24,979 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:24,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:24,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:24,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:24,980 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:24,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:24,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:24,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:24,983 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-02 00:21:24,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:24,983 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:24,991 INFO 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:25,004 INFO 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:25,006 INFO 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:25,009 INFO 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:25,012 INFO 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:25,014 INFO 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:25,019 INFO 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:25,028 INFO 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:25,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:25,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:25,040 INFO 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:25,047 INFO 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:25,050 INFO 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:25,796 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2019-01-02 00:21:26,075 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-01-02 00:21:26,076 INFO 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:26,078 INFO 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:26,080 INFO 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:26,081 INFO 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:26,084 INFO 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:26,086 INFO 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:26,088 INFO 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:26,091 INFO 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:26,094 INFO 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:26,534 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-02 00:21:27,119 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-02 00:21:27,827 WARN L181 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-02 00:21:28,007 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-02 00:21:28,084 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:28,085 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:28,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:28,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:28,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:28,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:28,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:28,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:28,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,170 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-02 00:21:28,170 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:21:28,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,184 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2019-01-02 00:21:28,184 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-02 00:21:28,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,251 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:21:28,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,258 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:21:28,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:28,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:28,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:28,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:28,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:28,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:28,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:28,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:28,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:28,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:28,399 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:21:28,399 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:21:28,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:28,401 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:28,402 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:28,402 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2019-01-02 00:21:29,299 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2019-01-02 00:21:29,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:29,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:29,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:29,440 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:29,440 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:21:29,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-02 00:21:29,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 37 states and 43 transitions. Complement of second has 6 states. [2019-01-02 00:21:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:21:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-02 00:21:29,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:21:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:29,495 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:29,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:29,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:29,582 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:29,584 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:21:29,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-02 00:21:29,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 37 states and 43 transitions. Complement of second has 6 states. [2019-01-02 00:21:29,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:21:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-02 00:21:29,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:21:29,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:29,659 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:29,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:29,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:29,748 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:29,748 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:21:29,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-02 00:21:29,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 37 states and 44 transitions. Complement of second has 5 states. [2019-01-02 00:21:29,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:21:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-02 00:21:29,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:21:29,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:29,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-02 00:21:29,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:29,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-02 00:21:29,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:29,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-01-02 00:21:29,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:29,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-01-02 00:21:29,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:21:29,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:21:29,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:21:29,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:29,809 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:29,809 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:29,809 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:29,809 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:21:29,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:21:29,810 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:29,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:21:29,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:21:29 BoogieIcfgContainer [2019-01-02 00:21:29,817 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:21:29,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:21:29,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:21:29,818 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:21:29,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:13" (3/4) ... [2019-01-02 00:21:29,822 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:21:29,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:21:29,824 INFO L168 Benchmark]: Toolchain (without parser) took 17366.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.9 MB). Free memory was 954.0 MB in the beginning and 1.3 GB in the end (delta: -296.9 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:29,825 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:29,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 657.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:29,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.85 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:29,832 INFO L168 Benchmark]: Boogie Preprocessor took 33.93 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:29,833 INFO L168 Benchmark]: RCFGBuilder took 484.48 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:29,833 INFO L168 Benchmark]: BuchiAutomizer took 16130.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -138.8 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:29,834 INFO L168 Benchmark]: Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:29,839 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 657.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.85 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.93 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 484.48 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16130.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -138.8 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * pt and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 14.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 112 SDslu, 62 SDs, 0 SdLazy, 92 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital255 mio100 ax100 hnf99 lsp96 ukn85 mio100 lsp39 div100 bol100 ite100 ukn100 eq194 hnf88 smp95 dnf258 smp87 tf100 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...