./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 0ed9222f 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-0ed9222-m [2019-01-14 04:58:59,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:58:59,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:58:59,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:58:59,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:58:59,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:58:59,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:58:59,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:58:59,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:58:59,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:58:59,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:58:59,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:58:59,874 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:58:59,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:58:59,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:58:59,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:58:59,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:58:59,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:58:59,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:58:59,884 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:58:59,885 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:58:59,886 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:58:59,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:58:59,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:58:59,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:58:59,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:58:59,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:58:59,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:58:59,894 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:58:59,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:58:59,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:58:59,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:58:59,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:58:59,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:58:59,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:58:59,903 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:58:59,903 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:58:59,935 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:58:59,935 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:58:59,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:58:59,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:58:59,938 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:58:59,938 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:58:59,939 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:58:59,940 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:58:59,940 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:58:59,940 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:58:59,940 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:58:59,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:58:59,941 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:58:59,941 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:58:59,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:58:59,941 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:58:59,941 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:58:59,942 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:58:59,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:58:59,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:58:59,944 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:58:59,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:58:59,945 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:58:59,945 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:58:59,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:58:59,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:58:59,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:58:59,946 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:58:59,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:58:59,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:58:59,946 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:58:59,952 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:58:59,953 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-14 04:59:00,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:59:00,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:59:00,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:59:00,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:59:00,040 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:59:00,041 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-14 04:59:00,099 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53129bb5a/5fd194da564a4de99b8aa7089b1fb3bb/FLAG0408da7c5 [2019-01-14 04:59:00,614 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:59:00,615 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:59:00,629 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53129bb5a/5fd194da564a4de99b8aa7089b1fb3bb/FLAG0408da7c5 [2019-01-14 04:59:00,937 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53129bb5a/5fd194da564a4de99b8aa7089b1fb3bb [2019-01-14 04:59:00,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:59:00,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:59:00,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:00,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:59:00,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:59:00,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:00" (1/1) ... [2019-01-14 04:59:00,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc44fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:00, skipping insertion in model container [2019-01-14 04:59:00,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:00" (1/1) ... [2019-01-14 04:59:00,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:59:01,012 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:59:01,335 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:01,348 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:59:01,418 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:01,491 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:59:01,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01 WrapperNode [2019-01-14 04:59:01,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:01,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:01,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:59:01,493 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:59:01,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:01,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:59:01,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:59:01,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:59:01,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (1/1) ... [2019-01-14 04:59:01,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:59:01,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:59:01,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:59:01,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:59:01,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (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-14 04:59:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:59:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:59:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:59:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:59:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:59:01,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:59:02,147 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:59:02,148 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:59:02,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:02 BoogieIcfgContainer [2019-01-14 04:59:02,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:59:02,150 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:59:02,150 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:59:02,155 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:59:02,155 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:02,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:59:00" (1/3) ... [2019-01-14 04:59:02,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2591a89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:02, skipping insertion in model container [2019-01-14 04:59:02,158 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:02,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:01" (2/3) ... [2019-01-14 04:59:02,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2591a89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:02, skipping insertion in model container [2019-01-14 04:59:02,158 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:02,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:02" (3/3) ... [2019-01-14 04:59:02,162 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:59:02,222 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:59:02,223 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:59:02,223 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:59:02,223 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:59:02,224 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:59:02,224 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:59:02,224 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:59:02,224 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:59:02,225 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:59:02,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:59:02,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:59:02,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:02,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:02,268 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:02,268 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:02,268 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:59:02,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 04:59:02,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:59:02,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:02,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:02,272 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:02,272 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:02,281 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-14 04:59:02,282 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-14 04:59:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 04:59:02,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:02,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2019-01-14 04:59:02,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:02,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:02,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:02,529 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-14 04:59:02,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:02,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:59:02,537 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:59:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:59:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:59:02,565 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-14 04:59:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:02,578 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-01-14 04:59:02,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:59:02,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-14 04:59:02,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:59:02,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2019-01-14 04:59:02,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 04:59:02,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 04:59:02,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 04:59:02,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:02,599 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 04:59:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 04:59:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 04:59:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 04:59:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 04:59:02,640 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 04:59:02,640 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 04:59:02,640 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:59:02,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 04:59:02,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:59:02,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:02,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:02,644 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:02,645 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:02,645 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-14 04:59:02,648 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 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-14 04:59:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 04:59:02,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2019-01-14 04:59:02,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:02,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2019-01-14 04:59:02,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:02,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:02,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:03,507 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-14 04:59:03,685 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 04:59:04,350 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 04:59:04,545 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 04:59:04,558 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:59:04,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:59:04,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:59:04,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:59:04,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:59:04,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:04,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:59:04,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:59:04,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:59:04,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:59:04,562 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:59:04,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:04,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,165 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-14 04:59:05,404 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-14 04:59:05,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:05,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:06,085 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-14 04:59:06,576 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 04:59:06,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:59:06,739 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:59:06,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:06,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:06,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:06,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:06,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:06,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:06,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:06,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:06,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:06,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:06,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:06,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:06,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:06,751 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 04:59:06,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:06,757 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:59:06,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:06,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:06,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:06,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:06,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:06,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:06,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:06,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:06,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:06,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:06,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:06,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:06,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:06,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:06,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:06,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:06,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:06,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:06,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:06,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:06,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:06,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:06,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:06,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:06,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:06,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:06,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:06,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:06,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:06,803 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:59:06,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:06,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:06,815 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:59:06,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:06,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:06,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:06,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:06,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:06,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:06,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:06,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:06,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:06,895 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:59:06,945 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:59:06,947 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:59:06,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:59:06,953 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:59:06,954 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:59:06,955 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-14 04:59:07,116 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 04:59:07,149 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:59:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:07,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:07,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:07,393 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-14 04:59:07,397 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-14 04:59:07,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 04:59:07,477 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-14 04:59:07,478 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-14 04:59:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:59:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-14 04:59:07,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2019-01-14 04:59:07,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:07,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2019-01-14 04:59:07,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:07,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 04:59:07,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:07,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-14 04:59:07,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:59:07,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2019-01-14 04:59:07,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:59:07,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:59:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-01-14 04:59:07,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:59:07,489 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 04:59:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-01-14 04:59:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 04:59:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:59:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-01-14 04:59:07,493 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 04:59:07,493 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 04:59:07,493 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:59:07,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-01-14 04:59:07,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:59:07,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:07,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:07,495 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:07,496 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:59:07,497 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-14 04:59:07,497 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;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-14 04:59:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-01-14 04:59:07,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:07,534 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2019-01-14 04:59:07,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:07,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2019-01-14 04:59:07,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,783 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 04:59:08,216 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-01-14 04:59:08,387 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-14 04:59:08,392 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:59:08,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:59:08,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:59:08,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:59:08,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:59:08,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:08,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:59:08,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:59:08,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:59:08,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:59:08,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:59:08,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:08,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:09,017 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-14 04:59:09,227 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-01-14 04:59:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:09,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:09,506 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-14 04:59:10,721 WARN L181 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 04:59:10,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:59:10,759 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:59:10,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:10,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:10,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:10,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:10,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:10,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:10,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:10,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:10,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:10,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:10,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:10,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:10,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:10,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:10,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:10,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:10,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:10,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:10,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:10,912 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:59:10,940 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:59:10,941 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:59:10,941 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:59:10,942 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:59:10,944 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:59:10,944 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~pt~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1) = -1*ULTIMATE.start_substring_~pt~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 Supporting invariants [] [2019-01-14 04:59:11,519 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2019-01-14 04:59:11,560 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:59:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:11,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:11,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:11,757 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-14 04:59:11,758 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-14 04:59:11,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 04:59:11,831 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-14 04:59:11,835 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-14 04:59:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:59:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-14 04:59:11,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 04:59:11,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:11,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 04:59:11,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:11,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 04:59:11,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:11,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2019-01-14 04:59:11,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:59:11,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2019-01-14 04:59:11,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:59:11,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 04:59:11,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-01-14 04:59:11,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:59:11,844 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-01-14 04:59:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-01-14 04:59:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-01-14 04:59:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 04:59:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-01-14 04:59:11,852 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-14 04:59:11,852 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-14 04:59:11,852 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:59:11,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2019-01-14 04:59:11,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 04:59:11,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:11,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:11,855 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:11,855 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:59:11,856 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-14 04:59:11,856 INFO L796 eck$LassoCheckResult]: Loop: 409#L546-1 assume !substring_#t~short6; 419#L546-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;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-14 04:59:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2019-01-14 04:59:11,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:11,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:11,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:11,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2019-01-14 04:59:11,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:11,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:11,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:11,945 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-14 04:59:11,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:11,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:59:11,946 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:59:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:59:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:59:11,947 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-14 04:59:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:12,044 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-01-14 04:59:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:59:12,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-01-14 04:59:12,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:59:12,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2019-01-14 04:59:12,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:59:12,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:59:12,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-01-14 04:59:12,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:59:12,052 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-14 04:59:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-01-14 04:59:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-14 04:59:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:59:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-14 04:59:12,059 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 04:59:12,059 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-14 04:59:12,059 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:59:12,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-14 04:59:12,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:59:12,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:12,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:12,064 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:12,064 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:59:12,064 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 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-14 04:59:12,064 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;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-14 04:59:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2019-01-14 04:59:12,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:12,304 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-14 04:59:12,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:12,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:59:12,304 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:59:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2019-01-14 04:59:12,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,549 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 04:59:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:59:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:59:12,585 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 04:59:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:12,626 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-01-14 04:59:12,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:59:12,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-01-14 04:59:12,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:59:12,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2019-01-14 04:59:12,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:59:12,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:59:12,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-01-14 04:59:12,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:59:12,630 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-14 04:59:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-01-14 04:59:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 04:59:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:59:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-14 04:59:12,635 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-14 04:59:12,635 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-14 04:59:12,635 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:59:12,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-01-14 04:59:12,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:59:12,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:12,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:12,638 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:12,638 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:59:12,639 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 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-14 04:59:12,639 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;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-14 04:59:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2019-01-14 04:59:12,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:12,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2019-01-14 04:59:12,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2019-01-14 04:59:12,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,880 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 04:59:13,831 WARN L181 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 146 [2019-01-14 04:59:14,063 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-14 04:59:14,072 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:59:14,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:59:14,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:59:14,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:59:14,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:59:14,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:14,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:59:14,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:59:14,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-14 04:59:14,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:59:14,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:59:14,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-14 04:59:14,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-14 04:59:14,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,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-14 04:59:14,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,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-14 04:59:14,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:14,825 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2019-01-14 04:59:15,096 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-01-14 04:59:15,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:15,644 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-14 04:59:16,243 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-14 04:59:16,903 WARN L181 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 04:59:17,077 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 04:59:17,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:59:17,156 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:59:17,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-14 04:59:17,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:17,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:17,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:17,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,237 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-14 04:59:17,237 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:59:17,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,257 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2019-01-14 04:59:17,258 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:59:17,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,318 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:59:17,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,331 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:59:17,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:17,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:17,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:17,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:17,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:17,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:17,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:17,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:17,480 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:59:17,500 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:59:17,500 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:59:17,501 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:59:17,501 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:59:17,501 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:59:17,502 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-14 04:59:18,032 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2019-01-14 04:59:18,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:59:18,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:18,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:18,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:18,199 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-14 04:59:18,203 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-14 04:59:18,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 04:59:18,269 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-14 04:59:18,272 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-14 04:59:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:59:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 04:59:18,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:59:18,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:18,273 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:59:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:18,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:18,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:18,362 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-14 04:59:18,364 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-14 04:59:18,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 04:59:18,439 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-14 04:59:18,440 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-14 04:59:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:59:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 04:59:18,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:59:18,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:18,441 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:59:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:18,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:18,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:18,553 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-14 04:59:18,555 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-14 04:59:18,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 04:59:18,628 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-14 04:59:18,630 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-14 04:59:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:59:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-14 04:59:18,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:59:18,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:18,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 04:59:18,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:18,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 04:59:18,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:18,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-01-14 04:59:18,635 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:59:18,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-01-14 04:59:18,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:59:18,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:59:18,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:59:18,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:18,637 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:59:18,637 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:59:18,637 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:59:18,637 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:59:18,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:59:18,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:59:18,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:59:18,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:59:18 BoogieIcfgContainer [2019-01-14 04:59:18,645 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:59:18,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:59:18,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:59:18,646 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:59:18,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:02" (3/4) ... [2019-01-14 04:59:18,651 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:59:18,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:59:18,652 INFO L168 Benchmark]: Toolchain (without parser) took 17710.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 368.1 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -278.8 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,654 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:59:18,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.93 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,657 INFO L168 Benchmark]: Boogie Preprocessor took 54.15 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-14 04:59:18,657 INFO L168 Benchmark]: RCFGBuilder took 464.24 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.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,658 INFO L168 Benchmark]: BuchiAutomizer took 16495.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.5 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,659 INFO L168 Benchmark]: Witness Printer took 4.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:59:18,664 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 548.93 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.15 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 464.24 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.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16495.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.5 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 -1 * pt + unknown-#length-unknown[nondetString1] 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.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 14.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. 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: 76ms 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...