./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/array-memsafety/substring-alloca-2.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 6e748b563bb7a11726b28f7957ce1a00b7c8807b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:26:41,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:41,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:42,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:42,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:42,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:42,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:42,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:42,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:42,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:42,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:42,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:42,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:42,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:42,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:42,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:42,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:42,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:42,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:42,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:42,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:42,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:42,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:42,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:42,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:42,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:42,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:42,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:42,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:42,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:42,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:42,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:42,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:42,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:42,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:42,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:42,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:42,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:42,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:42,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:42,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:42,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:42,068 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:42,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:42,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:42,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:42,071 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:42,071 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:42,071 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:42,071 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:42,072 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:42,072 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:42,072 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:42,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:42,073 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:42,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:42,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:42,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:42,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:42,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:42,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:42,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:42,074 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:42,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:42,075 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:42,075 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:42,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:42,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:42,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:42,076 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:42,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:42,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:42,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:42,077 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:42,078 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:42,078 INFO L138 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 -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2020-07-29 03:26:42,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:42,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:42,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:42,469 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:42,471 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:42,473 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2020-07-29 03:26:42,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6f97272/0111055656524cf4b7a2ab60f18cf42a/FLAG51c9379b5 [2020-07-29 03:26:43,100 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:43,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2020-07-29 03:26:43,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6f97272/0111055656524cf4b7a2ab60f18cf42a/FLAG51c9379b5 [2020-07-29 03:26:43,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6f97272/0111055656524cf4b7a2ab60f18cf42a [2020-07-29 03:26:43,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:43,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:43,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:43,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:43,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:43,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:43" (1/1) ... [2020-07-29 03:26:43,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760d9769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:43, skipping insertion in model container [2020-07-29 03:26:43,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:43" (1/1) ... [2020-07-29 03:26:43,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:43,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:43,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:43,929 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:44,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:44,068 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:44,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44 WrapperNode [2020-07-29 03:26:44,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:44,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:44,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:44,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:44,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:44,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:44,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:44,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:44,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (1/1) ... [2020-07-29 03:26:44,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:44,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:44,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:44,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:44,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (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 [2020-07-29 03:26:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:44,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:44,713 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:44,713 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-29 03:26:44,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:44 BoogieIcfgContainer [2020-07-29 03:26:44,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:44,718 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:44,718 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:44,722 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:44,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:44,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:43" (1/3) ... [2020-07-29 03:26:44,724 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d1ccdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:44, skipping insertion in model container [2020-07-29 03:26:44,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:44,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:44" (2/3) ... [2020-07-29 03:26:44,725 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d1ccdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:44, skipping insertion in model container [2020-07-29 03:26:44,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:44,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:44" (3/3) ... [2020-07-29 03:26:44,727 INFO L371 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2020-07-29 03:26:44,837 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:44,837 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:44,838 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:44,838 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:44,838 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:44,838 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:44,838 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:44,839 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:44,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-29 03:26:44,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:26:44,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:44,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:44,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:44,898 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:44,898 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:44,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-29 03:26:44,904 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:26:44,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:44,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:44,905 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:44,905 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:44,913 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 15#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 16#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 11#L535-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;main_~i~0 := 0; 24#L541-3true [2020-07-29 03:26:44,914 INFO L796 eck$LassoCheckResult]: Loop: 24#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 21#L541-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 24#L541-3true [2020-07-29 03:26:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:26:44,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:44,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302058536] [2020-07-29 03:26:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:26:45,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:45,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348016865] [2020-07-29 03:26:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,109 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:45,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:26:45,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:45,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470470446] [2020-07-29 03:26:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,175 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:45,503 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 03:26:45,650 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:45,651 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:45,652 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:45,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:45,652 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:45,653 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:45,653 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:45,653 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:45,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2020-07-29 03:26:45,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:45,655 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:45,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:46,623 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:46,628 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,641 INFO L120 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 [2020-07-29 03:26:46,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,679 INFO L120 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 [2020-07-29 03:26:46,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:46,736 INFO L120 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,767 INFO L120 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 [2020-07-29 03:26:46,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,796 INFO L120 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 [2020-07-29 03:26:46,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:46,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:46,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:46,829 INFO L120 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 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:46,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:46,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,887 INFO L120 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 [2020-07-29 03:26:46,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,923 INFO L120 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 [2020-07-29 03:26:46,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:46,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:46,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,960 INFO L120 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 [2020-07-29 03:26:46,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:46,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:46,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:46,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,989 INFO L120 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 [2020-07-29 03:26:46,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:46,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:46,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:46,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:46,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:46,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:46,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,051 INFO L120 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 [2020-07-29 03:26:47,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,110 INFO L120 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 [2020-07-29 03:26:47,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,153 INFO L120 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 [2020-07-29 03:26:47,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:47,233 INFO L120 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 [2020-07-29 03:26:47,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:47,294 INFO L120 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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:47,355 INFO L120 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 [2020-07-29 03:26:47,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,404 INFO L120 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 [2020-07-29 03:26:47,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,440 INFO L120 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 [2020-07-29 03:26:47,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:47,519 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 03:26:47,519 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,531 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:47,534 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:47,535 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:47,536 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 03:26:47,686 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:47,692 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16;" "main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15;" [2020-07-29 03:26:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {33#unseeded} is VALID [2020-07-29 03:26:47,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#unseeded} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {33#unseeded} is VALID [2020-07-29 03:26:47,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#unseeded} assume !(main_~length1~0 < 1); {33#unseeded} is VALID [2020-07-29 03:26:47,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#unseeded} assume !(main_~length2~0 < 1); {33#unseeded} is VALID [2020-07-29 03:26:47,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#unseeded} 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;main_~i~0 := 0; {33#unseeded} is VALID [2020-07-29 03:26:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#(>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {93#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:26:47,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {93#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {76#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:47,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:47,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:47,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:47,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,878 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 [2020-07-29 03:26:47,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 3 states. [2020-07-29 03:26:48,082 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 3 states. Result 57 states and 84 transitions. Complement of second has 7 states. [2020-07-29 03:26:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:48,083 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:48,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-29 03:26:48,086 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:26:48,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:48,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:48,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 84 transitions. [2020-07-29 03:26:48,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:26:48,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,115 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states. [2020-07-29 03:26:48,124 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 03:26:48,131 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 03:26:48,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:48,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:48,143 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:48,143 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 84 transitions. cyclomatic complexity: 34 [2020-07-29 03:26:48,147 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:26:48,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:48,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:48,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:48,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:48,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:48,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:48,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:26:48,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:26:48,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 57 letters. Loop has 57 letters. [2020-07-29 03:26:48,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:48,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:48,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:48,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:48,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:48,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:48,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:26:48,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:26:48,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:26:48,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:48,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:48,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:48,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 03:26:48,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 03:26:48,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 5 letters. [2020-07-29 03:26:48,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:26:48,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:26:48,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:26:48,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:48,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:48,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:48,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:26:48,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:26:48,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:26:48,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:48,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:48,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:48,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:48,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:48,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:48,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:48,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:48,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:48,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:48,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:48,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:48,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:48,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:48,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:48,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:48,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:48,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:48,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:48,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:48,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:48,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:48,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:48,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:48,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:48,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:48,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:48,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:48,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:48,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:48,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:48,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,192 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-07-29 03:26:48,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:48,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:48,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:26:48,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. cyclomatic complexity: 34 [2020-07-29 03:26:48,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:26:48,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2020-07-29 03:26:48,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:26:48,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:26:48,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-07-29 03:26:48,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:48,215 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 03:26:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-07-29 03:26:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-29 03:26:48,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:48,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand 19 states. [2020-07-29 03:26:48,252 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand 19 states. [2020-07-29 03:26:48,255 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 19 states. [2020-07-29 03:26:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:48,262 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:26:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:26:48,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:48,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:48,265 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states and 26 transitions. [2020-07-29 03:26:48,265 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states and 26 transitions. [2020-07-29 03:26:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:48,267 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:26:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:26:48,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:48,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:48,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:48,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 03:26:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-07-29 03:26:48,272 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 03:26:48,272 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 03:26:48,272 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:48,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:26:48,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:26:48,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,274 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:48,274 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:48,275 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 176#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 177#L532 assume !(main_~length1~0 < 1); 178#L532-2 assume !(main_~length2~0 < 1); 173#L535-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;main_~i~0 := 0; 174#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 166#L541-4 main_~i~1 := 0; 167#L547-3 [2020-07-29 03:26:48,275 INFO L796 eck$LassoCheckResult]: Loop: 167#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 172#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 167#L547-3 [2020-07-29 03:26:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-07-29 03:26:48,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:48,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266515049] [2020-07-29 03:26:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:48,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:48,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:48,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-07-29 03:26:48,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:48,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383378693] [2020-07-29 03:26:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:48,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:48,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:48,358 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-07-29 03:26:48,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:48,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445830850] [2020-07-29 03:26:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:48,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:48,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:48,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:48,591 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-29 03:26:48,675 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:48,675 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:48,675 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:48,675 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:48,676 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:48,676 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:48,676 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:48,676 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:48,676 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2020-07-29 03:26:48,676 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:48,676 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:48,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:48,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:49,533 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:49,534 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:49,540 INFO L120 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 [2020-07-29 03:26:49,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,589 INFO L120 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 [2020-07-29 03:26:49,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:49,633 INFO L120 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 [2020-07-29 03:26:49,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,681 INFO L120 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 [2020-07-29 03:26:49,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,725 INFO L120 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 [2020-07-29 03:26:49,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,756 INFO L120 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 [2020-07-29 03:26:49,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:49,801 INFO L120 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 [2020-07-29 03:26:49,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,832 INFO L120 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 [2020-07-29 03:26:49,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:49,885 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 03:26:49,885 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:49,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,910 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:49,910 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:49,910 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2020-07-29 03:26:49,961 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:49,964 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18;" "main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17;" [2020-07-29 03:26:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:49,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:50,006 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {230#unseeded} is VALID [2020-07-29 03:26:50,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#unseeded} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {230#unseeded} is VALID [2020-07-29 03:26:50,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#unseeded} assume !(main_~length1~0 < 1); {230#unseeded} is VALID [2020-07-29 03:26:50,008 INFO L280 TraceCheckUtils]: 3: Hoare triple {230#unseeded} assume !(main_~length2~0 < 1); {230#unseeded} is VALID [2020-07-29 03:26:50,009 INFO L280 TraceCheckUtils]: 4: Hoare triple {230#unseeded} 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;main_~i~0 := 0; {230#unseeded} is VALID [2020-07-29 03:26:50,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {230#unseeded} assume !(main_~i~0 < main_~length1~0 - 1); {230#unseeded} is VALID [2020-07-29 03:26:50,010 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#unseeded} main_~i~1 := 0; {230#unseeded} is VALID [2020-07-29 03:26:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:50,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {233#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~length2~0))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {296#(and (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (+ oldRank0 ULTIMATE.start_main_~i~1)))} is VALID [2020-07-29 03:26:50,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {296#(and (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (+ oldRank0 ULTIMATE.start_main_~i~1)))} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {273#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~length2~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:50,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:50,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:50,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,059 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 [2020-07-29 03:26:50,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 03:26:50,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 42 transitions. Complement of second has 6 states. [2020-07-29 03:26:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:50,211 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:50,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 03:26:50,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:50,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:50,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2020-07-29 03:26:50,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:50,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,215 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 03:26:50,218 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:26:50,218 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:50,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:50,219 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:50,220 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 42 transitions. cyclomatic complexity: 17 [2020-07-29 03:26:50,222 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:50,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:50,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:26:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:26:50,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:26:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:26:50,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:26:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:26:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:50,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:50,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:50,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:50,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:50,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:50,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:50,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:50,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:50,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:50,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:50,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:50,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:50,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:50,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:50,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:50,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:50,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:50,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:50,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:50,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:50,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:50,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:50,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 7 letters. [2020-07-29 03:26:50,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 7 letters. [2020-07-29 03:26:50,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:50,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 7 letters. [2020-07-29 03:26:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:50,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:50,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:50,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:50,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:50,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:50,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:50,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:50,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:50,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:50,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:50,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,251 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 03:26:50,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:50,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:50,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:50,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. cyclomatic complexity: 17 [2020-07-29 03:26:50,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:50,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2020-07-29 03:26:50,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:26:50,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:26:50,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-07-29 03:26:50,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:50,258 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-29 03:26:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-07-29 03:26:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 03:26:50,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:50,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 28 transitions. Second operand 20 states. [2020-07-29 03:26:50,260 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 28 transitions. Second operand 20 states. [2020-07-29 03:26:50,261 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 20 states. [2020-07-29 03:26:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:50,262 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-29 03:26:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2020-07-29 03:26:50,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:50,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:50,263 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 28 transitions. [2020-07-29 03:26:50,263 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 28 transitions. [2020-07-29 03:26:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:50,264 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-29 03:26:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2020-07-29 03:26:50,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:50,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:50,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:50,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:26:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2020-07-29 03:26:50,267 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-29 03:26:50,267 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-29 03:26:50,267 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:50,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2020-07-29 03:26:50,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:50,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,268 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:50,268 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:50,268 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 351#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 352#L532 assume !(main_~length1~0 < 1); 353#L532-2 assume !(main_~length2~0 < 1); 348#L535-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;main_~i~0 := 0; 349#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 340#L541-4 main_~i~1 := 0; 341#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 350#L547-4 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; 343#L517-3 [2020-07-29 03:26:50,269 INFO L796 eck$LassoCheckResult]: Loop: 343#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 338#L517-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; 339#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 342#L520-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; 355#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 344#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 345#L524 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; 343#L517-3 [2020-07-29 03:26:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-07-29 03:26:50,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411201528] [2020-07-29 03:26:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2020-07-29 03:26:50,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724189725] [2020-07-29 03:26:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2020-07-29 03:26:50,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863889457] [2020-07-29 03:26:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2020-07-29 03:26:50,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#true} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {405#true} is VALID [2020-07-29 03:26:50,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#true} assume !(main_~length1~0 < 1); {407#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:50,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {407#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {407#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:50,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {407#(<= 1 ULTIMATE.start_main_~length1~0)} 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;main_~i~0 := 0; {408#(and (or (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (not (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:50,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#(and (or (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (not (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~0 < main_~length1~0 - 1); {409#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:50,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {409#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} main_~i~1 := 0; {409#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:50,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {409#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} assume !(main_~i~1 < main_~length2~0 - 1); {409#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:50,623 INFO L280 TraceCheckUtils]: 8: Hoare triple {409#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} 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; {410#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) ULTIMATE.start_substring_~ps~0.offset))} is VALID [2020-07-29 03:26:50,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {410#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) ULTIMATE.start_substring_~ps~0.offset))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {411#(= 0 |ULTIMATE.start_substring_#t~mem2|)} is VALID [2020-07-29 03:26:50,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {411#(= 0 |ULTIMATE.start_substring_#t~mem2|)} 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; {406#false} is VALID [2020-07-29 03:26:50,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#false} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {406#false} is VALID [2020-07-29 03:26:50,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#false} 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; {406#false} is VALID [2020-07-29 03:26:50,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#false} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {406#false} is VALID [2020-07-29 03:26:50,626 INFO L280 TraceCheckUtils]: 14: Hoare triple {406#false} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {406#false} is VALID [2020-07-29 03:26:50,627 INFO L280 TraceCheckUtils]: 15: Hoare triple {406#false} 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; {406#false} is VALID [2020-07-29 03:26:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:50,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863889457] [2020-07-29 03:26:50,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:50,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 03:26:50,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206883053] [2020-07-29 03:26:50,781 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-07-29 03:26:50,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:50,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:26:50,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:26:50,844 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-07-29 03:26:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:51,194 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-07-29 03:26:51,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:26:51,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:26:51,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:51,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2020-07-29 03:26:51,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:51,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 28 transitions. [2020-07-29 03:26:51,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:26:51,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:26:51,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-07-29 03:26:51,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:51,226 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 03:26:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-07-29 03:26:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-29 03:26:51,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:51,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 28 transitions. Second operand 20 states. [2020-07-29 03:26:51,228 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 28 transitions. Second operand 20 states. [2020-07-29 03:26:51,228 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 20 states. [2020-07-29 03:26:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:51,229 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 03:26:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 03:26:51,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:51,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:51,230 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states and 28 transitions. [2020-07-29 03:26:51,230 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states and 28 transitions. [2020-07-29 03:26:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:51,231 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 03:26:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 03:26:51,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:51,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:51,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:51,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:26:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-07-29 03:26:51,233 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-29 03:26:51,233 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-29 03:26:51,233 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:51,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-07-29 03:26:51,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:51,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:51,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:51,234 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:51,234 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:51,235 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 459#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 460#L532 assume !(main_~length1~0 < 1); 461#L532-2 assume !(main_~length2~0 < 1); 456#L535-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;main_~i~0 := 0; 457#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 464#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 465#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 448#L541-4 main_~i~1 := 0; 449#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 458#L547-4 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; 451#L517-3 [2020-07-29 03:26:51,235 INFO L796 eck$LassoCheckResult]: Loop: 451#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 446#L517-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; 447#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 450#L520-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; 463#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 452#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 453#L524 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; 451#L517-3 [2020-07-29 03:26:51,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-07-29 03:26:51,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:51,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879445527] [2020-07-29 03:26:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:51,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:51,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:51,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2020-07-29 03:26:51,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:51,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11135579] [2020-07-29 03:26:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:51,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:51,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:51,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2020169960, now seen corresponding path program 1 times [2020-07-29 03:26:51,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:51,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727705810] [2020-07-29 03:26:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {515#true} is VALID [2020-07-29 03:26:51,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {515#true} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {515#true} is VALID [2020-07-29 03:26:51,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {515#true} assume !(main_~length1~0 < 1); {515#true} is VALID [2020-07-29 03:26:51,588 INFO L280 TraceCheckUtils]: 3: Hoare triple {515#true} assume !(main_~length2~0 < 1); {517#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:51,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {517#(<= 1 ULTIMATE.start_main_~length2~0)} 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;main_~i~0 := 0; {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:51,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:51,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:51,591 INFO L280 TraceCheckUtils]: 7: Hoare triple {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:51,592 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {519#(and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:51,592 INFO L280 TraceCheckUtils]: 9: Hoare triple {519#(and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {520#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:51,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {520#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.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; {521#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~t.base) ULTIMATE.start_substring_~t.offset))} is VALID [2020-07-29 03:26:51,594 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~t.base) ULTIMATE.start_substring_~t.offset))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {521#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~t.base) ULTIMATE.start_substring_~t.offset))} is VALID [2020-07-29 03:26:51,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {521#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~t.base) ULTIMATE.start_substring_~t.offset))} 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; {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:51,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:51,596 INFO L280 TraceCheckUtils]: 14: Hoare triple {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} 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; {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:51,597 INFO L280 TraceCheckUtils]: 15: Hoare triple {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:51,598 INFO L280 TraceCheckUtils]: 16: Hoare triple {522#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {523#(= 0 |ULTIMATE.start_substring_#t~mem9|)} is VALID [2020-07-29 03:26:51,599 INFO L280 TraceCheckUtils]: 17: Hoare triple {523#(= 0 |ULTIMATE.start_substring_#t~mem9|)} 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; {516#false} is VALID [2020-07-29 03:26:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:51,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727705810] [2020-07-29 03:26:51,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:51,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 03:26:51,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284880132] [2020-07-29 03:26:51,732 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-07-29 03:26:51,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:51,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:26:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:26:51,789 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-07-29 03:26:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:52,228 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 03:26:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:26:52,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:26:52,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:52,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2020-07-29 03:26:52,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:52,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 42 transitions. [2020-07-29 03:26:52,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-29 03:26:52,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 03:26:52,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2020-07-29 03:26:52,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:52,270 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-07-29 03:26:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2020-07-29 03:26:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-29 03:26:52,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:52,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 42 transitions. Second operand 31 states. [2020-07-29 03:26:52,273 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 42 transitions. Second operand 31 states. [2020-07-29 03:26:52,273 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 31 states. [2020-07-29 03:26:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:52,275 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-29 03:26:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-29 03:26:52,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:52,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:52,275 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states and 42 transitions. [2020-07-29 03:26:52,275 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states and 42 transitions. [2020-07-29 03:26:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:52,277 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-29 03:26:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-29 03:26:52,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:52,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:52,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:52,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:26:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-07-29 03:26:52,279 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-07-29 03:26:52,279 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-07-29 03:26:52,279 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:52,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2020-07-29 03:26:52,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:52,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:52,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:52,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:52,281 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:52,281 INFO L794 eck$LassoCheckResult]: Stem: 585#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 582#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 583#L532 assume !(main_~length1~0 < 1); 584#L532-2 assume !(main_~length2~0 < 1); 578#L535-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;main_~i~0 := 0; 579#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 588#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 589#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 568#L541-4 main_~i~1 := 0; 569#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 580#L547-4 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; 571#L517-3 [2020-07-29 03:26:52,281 INFO L796 eck$LassoCheckResult]: Loop: 571#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 572#L517-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; 592#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 586#L520-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; 587#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 590#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 596#L520-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; 595#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 594#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 593#L524 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; 571#L517-3 [2020-07-29 03:26:52,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2020-07-29 03:26:52,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:52,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727334753] [2020-07-29 03:26:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1312710103, now seen corresponding path program 1 times [2020-07-29 03:26:52,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:52,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167212041] [2020-07-29 03:26:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1844492576, now seen corresponding path program 1 times [2020-07-29 03:26:52,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:52,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762365790] [2020-07-29 03:26:52,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:52,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {668#true} is VALID [2020-07-29 03:26:52,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {668#true} is VALID [2020-07-29 03:26:52,472 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#true} assume !(main_~length1~0 < 1); {668#true} is VALID [2020-07-29 03:26:52,472 INFO L280 TraceCheckUtils]: 3: Hoare triple {668#true} assume !(main_~length2~0 < 1); {668#true} is VALID [2020-07-29 03:26:52,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {668#true} 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;main_~i~0 := 0; {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:52,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:52,479 INFO L280 TraceCheckUtils]: 6: Hoare triple {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:52,480 INFO L280 TraceCheckUtils]: 7: Hoare triple {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:52,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {670#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {671#(and (= 0 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:52,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {671#(and (= 0 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {672#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:52,489 INFO L280 TraceCheckUtils]: 10: Hoare triple {672#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.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; {673#(and (<= (select |#length| ULTIMATE.start_substring_~t.base) 1) (= 0 ULTIMATE.start_substring_~t.offset))} is VALID [2020-07-29 03:26:52,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {673#(and (<= (select |#length| ULTIMATE.start_substring_~t.base) 1) (= 0 ULTIMATE.start_substring_~t.offset))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {673#(and (<= (select |#length| ULTIMATE.start_substring_~t.base) 1) (= 0 ULTIMATE.start_substring_~t.offset))} is VALID [2020-07-29 03:26:52,496 INFO L280 TraceCheckUtils]: 12: Hoare triple {673#(and (<= (select |#length| ULTIMATE.start_substring_~t.base) 1) (= 0 ULTIMATE.start_substring_~t.offset))} 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; {674#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (= 0 ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:52,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {674#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (= 0 ULTIMATE.start_substring_~pt~0.offset))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {674#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (= 0 ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:52,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {674#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (= 0 ULTIMATE.start_substring_~pt~0.offset))} 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; {674#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (= 0 ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:52,499 INFO L280 TraceCheckUtils]: 15: Hoare triple {674#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (= 0 ULTIMATE.start_substring_~pt~0.offset))} assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; {675#(<= (select |#length| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset)} is VALID [2020-07-29 03:26:52,500 INFO L280 TraceCheckUtils]: 16: Hoare triple {675#(<= (select |#length| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset)} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {669#false} is VALID [2020-07-29 03:26:52,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {669#false} 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; {669#false} is VALID [2020-07-29 03:26:52,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {669#false} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {669#false} is VALID [2020-07-29 03:26:52,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {669#false} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {669#false} is VALID [2020-07-29 03:26:52,501 INFO L280 TraceCheckUtils]: 20: Hoare triple {669#false} 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; {669#false} is VALID [2020-07-29 03:26:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:52,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762365790] [2020-07-29 03:26:52,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934658958] [2020-07-29 03:26:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:52,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 03:26:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:52,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:52,632 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:52,633 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 03:26:52,634 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:52,651 INFO L624 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-07-29 03:26:52,654 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:52,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2020-07-29 03:26:52,656 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:52,657 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_59|, |ULTIMATE.start_main_#t~malloc13.base|, ULTIMATE.start_main_~length1~0]. (= (store (store |v_#length_59| |ULTIMATE.start_main_#t~malloc13.base| ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0) |#length|) [2020-07-29 03:26:52,657 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) [2020-07-29 03:26:52,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {668#true} is VALID [2020-07-29 03:26:52,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {668#true} is VALID [2020-07-29 03:26:52,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#true} assume !(main_~length1~0 < 1); {668#true} is VALID [2020-07-29 03:26:52,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {668#true} assume !(main_~length2~0 < 1); {668#true} is VALID [2020-07-29 03:26:52,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {668#true} 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;main_~i~0 := 0; {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:52,923 INFO L280 TraceCheckUtils]: 5: Hoare triple {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:52,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:52,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} assume !(main_~i~0 < main_~length1~0 - 1); {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:52,936 INFO L280 TraceCheckUtils]: 8: Hoare triple {691#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} main_~i~1 := 0; {704#(and (<= ULTIMATE.start_main_~i~1 0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0))} is VALID [2020-07-29 03:26:52,937 INFO L280 TraceCheckUtils]: 9: Hoare triple {704#(and (<= ULTIMATE.start_main_~i~1 0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0))} assume !(main_~i~1 < main_~length2~0 - 1); {708#(<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1)} is VALID [2020-07-29 03:26:52,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {708#(<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1)} 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; {712#(<= (select |#length| ULTIMATE.start_substring_~t.base) 1)} is VALID [2020-07-29 03:26:52,947 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#(<= (select |#length| ULTIMATE.start_substring_~t.base) 1)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {712#(<= (select |#length| ULTIMATE.start_substring_~t.base) 1)} is VALID [2020-07-29 03:26:52,951 INFO L280 TraceCheckUtils]: 12: Hoare triple {712#(<= (select |#length| ULTIMATE.start_substring_~t.base) 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; {719#(<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1)} is VALID [2020-07-29 03:26:52,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {719#(<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1)} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {723#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (<= 0 ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:52,954 INFO L280 TraceCheckUtils]: 14: Hoare triple {723#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (<= 0 ULTIMATE.start_substring_~pt~0.offset))} 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; {723#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (<= 0 ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:52,955 INFO L280 TraceCheckUtils]: 15: Hoare triple {723#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (<= 0 ULTIMATE.start_substring_~pt~0.offset))} assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; {730#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (<= 1 ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:26:52,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {730#(and (<= (select |#length| ULTIMATE.start_substring_~pt~0.base) 1) (<= 1 ULTIMATE.start_substring_~pt~0.offset))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {669#false} is VALID [2020-07-29 03:26:52,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {669#false} 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; {669#false} is VALID [2020-07-29 03:26:52,957 INFO L280 TraceCheckUtils]: 18: Hoare triple {669#false} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {669#false} is VALID [2020-07-29 03:26:52,957 INFO L280 TraceCheckUtils]: 19: Hoare triple {669#false} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {669#false} is VALID [2020-07-29 03:26:52,957 INFO L280 TraceCheckUtils]: 20: Hoare triple {669#false} 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; {669#false} is VALID [2020-07-29 03:26:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:52,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 03:26:52,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2020-07-29 03:26:52,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107504396] [2020-07-29 03:26:53,282 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2020-07-29 03:26:53,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:26:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-29 03:26:53,391 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 14 Second operand 9 states. [2020-07-29 03:26:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:53,797 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:26:53,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:26:53,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:26:53,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:53,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-07-29 03:26:53,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:53,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 27 transitions. [2020-07-29 03:26:53,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:26:53,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:26:53,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-07-29 03:26:53,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:53,841 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-07-29 03:26:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-07-29 03:26:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-29 03:26:53,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:53,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 27 transitions. Second operand 20 states. [2020-07-29 03:26:53,843 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 27 transitions. Second operand 20 states. [2020-07-29 03:26:53,843 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 20 states. [2020-07-29 03:26:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:53,844 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2020-07-29 03:26:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2020-07-29 03:26:53,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:53,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:53,845 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states and 27 transitions. [2020-07-29 03:26:53,845 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states and 27 transitions. [2020-07-29 03:26:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:53,846 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2020-07-29 03:26:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2020-07-29 03:26:53,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:53,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:53,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:53,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:26:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-29 03:26:53,848 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:26:53,848 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:26:53,848 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:26:53,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:26:53,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:26:53,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:53,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:53,849 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:53,849 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:53,849 INFO L794 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 794#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 795#L532 assume !(main_~length1~0 < 1); 796#L532-2 assume !(main_~length2~0 < 1); 791#L535-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;main_~i~0 := 0; 792#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 799#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 800#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 783#L541-4 main_~i~1 := 0; 784#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 789#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 790#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 793#L547-4 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; 788#L517-3 [2020-07-29 03:26:53,849 INFO L796 eck$LassoCheckResult]: Loop: 788#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 781#L517-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; 782#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 785#L520-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; 798#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 786#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 787#L524 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; 788#L517-3 [2020-07-29 03:26:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-07-29 03:26:53,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:53,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206512750] [2020-07-29 03:26:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:53,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:53,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:53,912 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2020-07-29 03:26:53,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:53,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679051704] [2020-07-29 03:26:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:53,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:53,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:53,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:53,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2020-07-29 03:26:53,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:53,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107463153] [2020-07-29 03:26:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:53,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:54,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:54,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:54,187 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-07-29 03:26:54,995 WARN L193 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2020-07-29 03:26:55,287 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-07-29 03:26:55,295 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:55,295 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:55,295 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:55,295 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:55,295 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:55,295 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:55,295 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:55,296 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:55,296 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2020-07-29 03:26:55,296 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:55,296 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:55,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:55,965 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2020-07-29 03:26:56,154 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2020-07-29 03:26:56,157 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:56,158 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:56,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:56,844 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-07-29 03:26:57,312 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2020-07-29 03:26:57,620 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:57,620 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,625 INFO L120 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 [2020-07-29 03:26:57,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,651 INFO L120 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 [2020-07-29 03:26:57,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:57,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:57,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,679 INFO L120 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 [2020-07-29 03:26:57,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,711 INFO L120 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 [2020-07-29 03:26:57,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,736 INFO L120 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 [2020-07-29 03:26:57,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,761 INFO L120 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 [2020-07-29 03:26:57,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,786 INFO L120 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 [2020-07-29 03:26:57,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,812 INFO L120 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 [2020-07-29 03:26:57,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,838 INFO L120 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 [2020-07-29 03:26:57,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:57,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:57,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:57,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,865 INFO L120 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 [2020-07-29 03:26:57,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:57,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:57,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,895 INFO L120 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 [2020-07-29 03:26:57,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:57,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:57,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,941 INFO L120 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 [2020-07-29 03:26:57,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:57,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:57,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:57,995 INFO L120 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 [2020-07-29 03:26:57,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:57,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:57,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:57,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:57,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:57,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:58,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:58,025 INFO L120 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 [2020-07-29 03:26:58,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:58,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:58,027 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 03:26:58,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:58,071 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2020-07-29 03:26:58,071 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 03:26:58,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:58,213 INFO L120 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 Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:58,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:58,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:58,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:58,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:58,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:58,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:58,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:58,242 INFO L120 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 [2020-07-29 03:26:58,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:58,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:58,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:58,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:58,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:58,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:58,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:58,345 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 03:26:58,346 INFO L444 ModelExtractionUtils]: 43 out of 64 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:58,353 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:58,359 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:58,359 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:58,360 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_substring_~ps~0.base)_1) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_substring_~ps~0.base)_1 Supporting invariants [] [2020-07-29 03:26:58,537 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2020-07-29 03:26:58,541 INFO L393 LassoCheck]: Loop: "call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 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;" "call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3;" "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;" "assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;" "call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);" "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;" [2020-07-29 03:26:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:58,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:58,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:58,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:58,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {852#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {852#unseeded} is VALID [2020-07-29 03:26:58,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#unseeded} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {852#unseeded} is VALID [2020-07-29 03:26:58,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#unseeded} assume !(main_~length1~0 < 1); {852#unseeded} is VALID [2020-07-29 03:26:58,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {852#unseeded} assume !(main_~length2~0 < 1); {852#unseeded} is VALID [2020-07-29 03:26:58,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {852#unseeded} 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;main_~i~0 := 0; {852#unseeded} is VALID [2020-07-29 03:26:58,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {852#unseeded} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {852#unseeded} is VALID [2020-07-29 03:26:58,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {852#unseeded} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {852#unseeded} is VALID [2020-07-29 03:26:58,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {852#unseeded} assume !(main_~i~0 < main_~length1~0 - 1); {852#unseeded} is VALID [2020-07-29 03:26:58,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {852#unseeded} main_~i~1 := 0; {852#unseeded} is VALID [2020-07-29 03:26:58,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {852#unseeded} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {852#unseeded} is VALID [2020-07-29 03:26:58,627 INFO L280 TraceCheckUtils]: 10: Hoare triple {852#unseeded} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {852#unseeded} is VALID [2020-07-29 03:26:58,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {852#unseeded} assume !(main_~i~1 < main_~length2~0 - 1); {852#unseeded} is VALID [2020-07-29 03:26:58,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {852#unseeded} 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; {852#unseeded} is VALID [2020-07-29 03:26:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:58,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:26:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:58,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:58,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {855#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_substring_~ps~0.offset) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} is VALID [2020-07-29 03:26:58,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} 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; {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} is VALID [2020-07-29 03:26:58,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} is VALID [2020-07-29 03:26:58,701 INFO L280 TraceCheckUtils]: 3: Hoare triple {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} 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; {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} is VALID [2020-07-29 03:26:58,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} is VALID [2020-07-29 03:26:58,702 INFO L280 TraceCheckUtils]: 5: Hoare triple {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} is VALID [2020-07-29 03:26:58,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {986#(and (<= (select |#length| ULTIMATE.start_substring_~ps~0.base) (+ oldRank0 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps~0.base)))} 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; {945#(or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_substring_~ps~0.offset) (select |#length| ULTIMATE.start_substring_~ps~0.base))) (>= oldRank0 0)))} is VALID [2020-07-29 03:26:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:58,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:58,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:58,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,723 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 [2020-07-29 03:26:58,724 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 03:26:58,805 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 4 states. [2020-07-29 03:26:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:58,805 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:58,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:58,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:58,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:58,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:58,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:58,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:58,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:58,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2020-07-29 03:26:58,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:58,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:58,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:58,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:58,812 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:58,812 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:58,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:58,813 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:58,813 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 36 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:58,814 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:58,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:58,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:58,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:58,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:26:58,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:26:58,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:26:58,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:58,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:58,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:58,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:58,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:58,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:58,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:58,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:58,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:58,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 7 letters. [2020-07-29 03:26:58,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 7 letters. [2020-07-29 03:26:58,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 7 letters. [2020-07-29 03:26:58,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 7 letters. [2020-07-29 03:26:58,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 7 letters. [2020-07-29 03:26:58,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 7 letters. [2020-07-29 03:26:58,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:58,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:58,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2020-07-29 03:26:58,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:58,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:58,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:58,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:58,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:58,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:58,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:58,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:58,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:58,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:58,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:58,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:58,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:58,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,843 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-07-29 03:26:58,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 13 letters. Loop has 7 letters. [2020-07-29 03:26:58,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 20 letters. Loop has 7 letters. [2020-07-29 03:26:58,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 13 letters. Loop has 14 letters. [2020-07-29 03:26:58,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:58,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:58,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:58,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2020-07-29 03:26:58,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:58,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:26:58,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-07-29 03:26:58,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:58,850 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 03:26:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-07-29 03:26:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 03:26:58,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:58,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 34 transitions. Second operand 25 states. [2020-07-29 03:26:58,853 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 34 transitions. Second operand 25 states. [2020-07-29 03:26:58,853 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 25 states. [2020-07-29 03:26:58,854 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:58,858 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-07-29 03:26:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-07-29 03:26:58,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:58,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:58,859 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states and 34 transitions. [2020-07-29 03:26:58,859 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states and 34 transitions. [2020-07-29 03:26:58,860 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:58,862 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-07-29 03:26:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-07-29 03:26:58,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:58,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:58,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:58,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:26:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-07-29 03:26:58,865 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 03:26:58,865 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 03:26:58,865 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:26:58,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2020-07-29 03:26:58,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:58,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:58,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:58,866 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:58,867 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:58,867 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1055#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 1056#L532 assume !(main_~length1~0 < 1); 1057#L532-2 assume !(main_~length2~0 < 1); 1052#L535-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;main_~i~0 := 0; 1053#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1061#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1062#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1042#L541-4 main_~i~1 := 0; 1043#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1050#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1051#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1054#L547-4 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; 1048#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1038#L517-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; 1039#L520-5 [2020-07-29 03:26:58,867 INFO L796 eck$LassoCheckResult]: Loop: 1039#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1044#L520-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; 1059#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 1039#L520-5 [2020-07-29 03:26:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2020-07-29 03:26:58,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:58,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082049833] [2020-07-29 03:26:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2020-07-29 03:26:58,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:58,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840804651] [2020-07-29 03:26:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2020-07-29 03:26:58,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:58,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288921180] [2020-07-29 03:26:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:59,001 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:00,070 WARN L193 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 131 [2020-07-29 03:27:00,475 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-07-29 03:27:00,479 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:00,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:00,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:00,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:00,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:00,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:00,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:00,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:00,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2020-07-29 03:27:00,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:00,480 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:00,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:00,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,411 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 103 [2020-07-29 03:27:01,693 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-07-29 03:27:01,695 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:27:01,695 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:27:01,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:02,535 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-29 03:27:03,134 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-07-29 03:27:03,420 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:03,420 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,423 INFO L120 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 [2020-07-29 03:27:03,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:03,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:03,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:03,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:03,455 INFO L120 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 Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:03,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:03,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,484 INFO L120 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 [2020-07-29 03:27:03,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:03,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:03,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:03,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:03,526 INFO L120 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 [2020-07-29 03:27:03,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:03,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:03,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:03,554 INFO L120 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 [2020-07-29 03:27:03,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:03,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:03,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,585 INFO L120 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 [2020-07-29 03:27:03,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:03,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:03,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:03,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,611 INFO L120 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 [2020-07-29 03:27:03,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:03,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:03,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:03,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,638 INFO L120 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 [2020-07-29 03:27:03,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:03,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:03,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,669 INFO L120 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 [2020-07-29 03:27:03,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:03,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:03,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:03,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,697 INFO L120 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 [2020-07-29 03:27:03,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:03,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:03,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:03,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,724 INFO L120 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 [2020-07-29 03:27:03,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,726 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 03:27:03,726 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:27:03,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,737 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 03:27:03,738 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 03:27:03,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,791 INFO L120 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 [2020-07-29 03:27:03,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:03,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:03,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,824 INFO L120 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 [2020-07-29 03:27:03,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:03,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:03,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:03,858 INFO L120 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 Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:03,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:03,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:03,928 INFO L120 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 [2020-07-29 03:27:03,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:03,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:03,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:03,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:03,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:03,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:03,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:04,000 INFO L120 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 [2020-07-29 03:27:04,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:04,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:04,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:04,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:04,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:04,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:04,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:04,060 INFO L120 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 [2020-07-29 03:27:04,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:04,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:04,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:04,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:04,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:04,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:04,132 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:04,276 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2020-07-29 03:27:04,276 INFO L444 ModelExtractionUtils]: 8 out of 61 variables were initially zero. Simplification set additionally 50 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:04,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:04,283 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:27:04,283 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:04,283 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_4, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_4 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2020-07-29 03:27:04,526 INFO L297 tatePredicateManager]: 32 out of 34 supporting invariants were superfluous and have been removed [2020-07-29 03:27:04,534 INFO L393 LassoCheck]: Loop: "call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3;" "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;" "assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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;" [2020-07-29 03:27:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:04,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:27:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:04,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-29 03:27:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:04,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:04,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {1196#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1196#unseeded} is VALID [2020-07-29 03:27:04,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {1196#unseeded} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {1196#unseeded} is VALID [2020-07-29 03:27:04,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {1196#unseeded} assume !(main_~length1~0 < 1); {1196#unseeded} is VALID [2020-07-29 03:27:04,680 INFO L280 TraceCheckUtils]: 3: Hoare triple {1196#unseeded} assume !(main_~length2~0 < 1); {1196#unseeded} is VALID [2020-07-29 03:27:04,681 INFO L280 TraceCheckUtils]: 4: Hoare triple {1196#unseeded} 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;main_~i~0 := 0; {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,682 INFO L280 TraceCheckUtils]: 5: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,683 INFO L280 TraceCheckUtils]: 7: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,692 INFO L280 TraceCheckUtils]: 10: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:27:04,694 INFO L280 TraceCheckUtils]: 12: Hoare triple {1402#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc14.base|) unseeded (= 0 ULTIMATE.start_main_~nondetString2~0.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; {1427#(and (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 ULTIMATE.start_substring_~t.offset) unseeded)} is VALID [2020-07-29 03:27:04,695 INFO L280 TraceCheckUtils]: 13: Hoare triple {1427#(and (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 ULTIMATE.start_substring_~t.offset) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {1427#(and (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 ULTIMATE.start_substring_~t.offset) unseeded)} is VALID [2020-07-29 03:27:04,696 INFO L280 TraceCheckUtils]: 14: Hoare triple {1427#(and (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 ULTIMATE.start_substring_~t.offset) unseeded)} 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; {1381#(and (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~pt~0.offset) (= |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_substring_~pt~0.base) unseeded)} is VALID [2020-07-29 03:27:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:04,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 03:27:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:04,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:04,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {1382#(and (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~pt~0.offset) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc14.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_substring_~pt~0.base))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1434#(and (<= (+ ULTIMATE.start_substring_~pt~0.offset 1) (select |#length| ULTIMATE.start_substring_~pt~0.base)) (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~pt~0.offset) (= |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_substring_~pt~0.base) (<= (select |#length| |ULTIMATE.start_main_#t~malloc14.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} is VALID [2020-07-29 03:27:04,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {1434#(and (<= (+ ULTIMATE.start_substring_~pt~0.offset 1) (select |#length| ULTIMATE.start_substring_~pt~0.base)) (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~pt~0.offset) (= |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_substring_~pt~0.base) (<= (select |#length| |ULTIMATE.start_main_#t~malloc14.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} 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; {1434#(and (<= (+ ULTIMATE.start_substring_~pt~0.offset 1) (select |#length| ULTIMATE.start_substring_~pt~0.base)) (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~pt~0.offset) (= |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_substring_~pt~0.base) (<= (select |#length| |ULTIMATE.start_main_#t~malloc14.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} is VALID [2020-07-29 03:27:04,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {1434#(and (<= (+ ULTIMATE.start_substring_~pt~0.offset 1) (select |#length| ULTIMATE.start_substring_~pt~0.base)) (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~pt~0.offset) (= |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_substring_~pt~0.base) (<= (select |#length| |ULTIMATE.start_main_#t~malloc14.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; {1384#(and (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~pt~0.offset) (= |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_substring_~pt~0.base) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc14.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))))))} is VALID [2020-07-29 03:27:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:04,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:04,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:04,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:27:04,779 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-07-29 03:27:04,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 48 states and 64 transitions. Complement of second has 7 states. [2020-07-29 03:27:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:04,954 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:04,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:27:04,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:04,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:04,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:27:04,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:04,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:04,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:04,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2020-07-29 03:27:04,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:04,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:04,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:04,957 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:27:04,958 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:04,958 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:27:04,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:04,959 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:04,959 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 64 transitions. cyclomatic complexity: 22 [2020-07-29 03:27:04,959 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:04,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:04,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:04,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:04,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:27:04,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:27:04,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:27:04,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:27:04,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:27:04,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:27:04,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:27:04,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:27:04,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:27:04,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:04,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:04,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:04,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:27:04,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:27:04,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:27:04,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:27:04,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:27:04,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:27:04,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:04,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:04,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:27:04,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:27:04,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:27:04,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:27:04,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:27:04,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:27:04,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:27:04,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:04,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:04,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 22 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:04,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,969 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:27:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 03:27:04,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:27:04,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:27:04,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:27:04,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:04,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. cyclomatic complexity: 22 [2020-07-29 03:27:04,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:04,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 36 states and 48 transitions. [2020-07-29 03:27:04,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:27:04,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:27:04,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2020-07-29 03:27:04,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:04,974 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-07-29 03:27:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2020-07-29 03:27:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-07-29 03:27:04,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:04,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 48 transitions. Second operand 31 states. [2020-07-29 03:27:04,976 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 48 transitions. Second operand 31 states. [2020-07-29 03:27:04,976 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand 31 states. [2020-07-29 03:27:04,977 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:04,978 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-29 03:27:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2020-07-29 03:27:04,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:04,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:04,979 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 36 states and 48 transitions. [2020-07-29 03:27:04,979 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 36 states and 48 transitions. [2020-07-29 03:27:04,980 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:04,981 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-29 03:27:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2020-07-29 03:27:04,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:04,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:04,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:04,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:27:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-07-29 03:27:04,983 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-29 03:27:04,983 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-29 03:27:04,983 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:27:04,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-07-29 03:27:04,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:04,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:04,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:04,984 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:04,984 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:27:04,984 INFO L794 eck$LassoCheckResult]: Stem: 1523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1520#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 1521#L532 assume !(main_~length1~0 < 1); 1522#L532-2 assume !(main_~length2~0 < 1); 1517#L535-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;main_~i~0 := 0; 1518#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1527#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1528#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1506#L541-4 main_~i~1 := 0; 1507#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1515#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1516#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1519#L547-4 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; 1512#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1513#L517-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; 1530#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1525#L520-1 assume !substring_#t~short6; 1526#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 1510#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1511#L524 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; 1514#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1502#L517-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; 1503#L520-5 [2020-07-29 03:27:04,984 INFO L796 eck$LassoCheckResult]: Loop: 1503#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1508#L520-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; 1524#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 1503#L520-5 [2020-07-29 03:27:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1389384631, now seen corresponding path program 1 times [2020-07-29 03:27:04,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:04,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888865123] [2020-07-29 03:27:04,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:05,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {1698#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1698#true} is VALID [2020-07-29 03:27:05,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {1698#true} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {1698#true} is VALID [2020-07-29 03:27:05,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {1698#true} assume !(main_~length1~0 < 1); {1698#true} is VALID [2020-07-29 03:27:05,032 INFO L280 TraceCheckUtils]: 3: Hoare triple {1698#true} assume !(main_~length2~0 < 1); {1698#true} is VALID [2020-07-29 03:27:05,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {1698#true} 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;main_~i~0 := 0; {1698#true} is VALID [2020-07-29 03:27:05,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {1698#true} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {1698#true} is VALID [2020-07-29 03:27:05,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {1698#true} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {1698#true} is VALID [2020-07-29 03:27:05,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {1698#true} assume !(main_~i~0 < main_~length1~0 - 1); {1698#true} is VALID [2020-07-29 03:27:05,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {1698#true} main_~i~1 := 0; {1698#true} is VALID [2020-07-29 03:27:05,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {1698#true} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {1698#true} is VALID [2020-07-29 03:27:05,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {1698#true} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {1698#true} is VALID [2020-07-29 03:27:05,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {1698#true} assume !(main_~i~1 < main_~length2~0 - 1); {1698#true} is VALID [2020-07-29 03:27:05,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {1698#true} 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; {1698#true} is VALID [2020-07-29 03:27:05,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {1698#true} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {1698#true} is VALID [2020-07-29 03:27:05,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {1698#true} 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; {1698#true} is VALID [2020-07-29 03:27:05,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {1698#true} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1700#(or |ULTIMATE.start_substring_#t~short6| (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset)))} is VALID [2020-07-29 03:27:05,036 INFO L280 TraceCheckUtils]: 16: Hoare triple {1700#(or |ULTIMATE.start_substring_#t~short6| (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset)))} assume !substring_#t~short6; {1701#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:27:05,037 INFO L280 TraceCheckUtils]: 17: Hoare triple {1701#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {1701#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 03:27:05,037 INFO L280 TraceCheckUtils]: 18: Hoare triple {1701#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {1702#(= 0 |ULTIMATE.start_substring_#t~mem9|)} is VALID [2020-07-29 03:27:05,038 INFO L280 TraceCheckUtils]: 19: Hoare triple {1702#(= 0 |ULTIMATE.start_substring_#t~mem9|)} 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; {1699#false} is VALID [2020-07-29 03:27:05,038 INFO L280 TraceCheckUtils]: 20: Hoare triple {1699#false} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {1699#false} is VALID [2020-07-29 03:27:05,038 INFO L280 TraceCheckUtils]: 21: Hoare triple {1699#false} 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; {1699#false} is VALID [2020-07-29 03:27:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 03:27:05,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888865123] [2020-07-29 03:27:05,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:05,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:27:05,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942248940] [2020-07-29 03:27:05,040 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 2 times [2020-07-29 03:27:05,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:05,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734079292] [2020-07-29 03:27:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:05,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:05,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:05,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:05,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:27:05,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:27:05,183 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-07-29 03:27:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:05,301 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2020-07-29 03:27:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:05,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:05,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:05,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2020-07-29 03:27:05,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:27:05,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 44 transitions. [2020-07-29 03:27:05,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:27:05,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:27:05,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-07-29 03:27:05,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:05,338 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 03:27:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-07-29 03:27:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-29 03:27:05,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:05,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 44 transitions. Second operand 32 states. [2020-07-29 03:27:05,340 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 44 transitions. Second operand 32 states. [2020-07-29 03:27:05,340 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 32 states. [2020-07-29 03:27:05,341 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:05,342 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 03:27:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-29 03:27:05,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:05,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:05,343 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states and 44 transitions. [2020-07-29 03:27:05,343 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states and 44 transitions. [2020-07-29 03:27:05,343 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:05,345 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 03:27:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-29 03:27:05,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:05,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:05,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:05,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:27:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-07-29 03:27:05,346 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-07-29 03:27:05,347 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-07-29 03:27:05,347 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:27:05,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-07-29 03:27:05,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:05,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:05,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:05,348 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:05,348 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:27:05,348 INFO L794 eck$LassoCheckResult]: Stem: 1765#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1762#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 1763#L532 assume !(main_~length1~0 < 1); 1764#L532-2 assume !(main_~length2~0 < 1); 1759#L535-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;main_~i~0 := 0; 1760#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1769#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1770#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1748#L541-4 main_~i~1 := 0; 1749#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1757#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1758#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1761#L547-4 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; 1752#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1753#L517-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; 1774#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1773#L520-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; 1772#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 1755#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1756#L524 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; 1754#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1744#L517-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; 1745#L520-5 [2020-07-29 03:27:05,348 INFO L796 eck$LassoCheckResult]: Loop: 1745#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1750#L520-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; 1766#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 1745#L520-5 [2020-07-29 03:27:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1446642933, now seen corresponding path program 2 times [2020-07-29 03:27:05,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:05,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928776961] [2020-07-29 03:27:05,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:05,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {1937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1937#true} is VALID [2020-07-29 03:27:05,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {1937#true} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {1937#true} is VALID [2020-07-29 03:27:05,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {1937#true} assume !(main_~length1~0 < 1); {1937#true} is VALID [2020-07-29 03:27:05,662 INFO L280 TraceCheckUtils]: 3: Hoare triple {1937#true} assume !(main_~length2~0 < 1); {1937#true} is VALID [2020-07-29 03:27:05,663 INFO L280 TraceCheckUtils]: 4: Hoare triple {1937#true} 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;main_~i~0 := 0; {1939#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:27:05,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {1939#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {1940#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))))} is VALID [2020-07-29 03:27:05,665 INFO L280 TraceCheckUtils]: 6: Hoare triple {1940#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {1941#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (or (and (<= 2 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))))} is VALID [2020-07-29 03:27:05,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {1941#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (or (and (<= 2 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))))} assume !(main_~i~0 < main_~length1~0 - 1); {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:27:05,667 INFO L280 TraceCheckUtils]: 8: Hoare triple {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:27:05,667 INFO L280 TraceCheckUtils]: 9: Hoare triple {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:27:05,668 INFO L280 TraceCheckUtils]: 10: Hoare triple {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:27:05,670 INFO L280 TraceCheckUtils]: 11: Hoare triple {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:27:05,671 INFO L280 TraceCheckUtils]: 12: Hoare triple {1942#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} 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; {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} is VALID [2020-07-29 03:27:05,672 INFO L280 TraceCheckUtils]: 13: Hoare triple {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} is VALID [2020-07-29 03:27:05,673 INFO L280 TraceCheckUtils]: 14: Hoare triple {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 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; {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} is VALID [2020-07-29 03:27:05,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} is VALID [2020-07-29 03:27:05,674 INFO L280 TraceCheckUtils]: 16: Hoare triple {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 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; {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} is VALID [2020-07-29 03:27:05,675 INFO L280 TraceCheckUtils]: 17: Hoare triple {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} is VALID [2020-07-29 03:27:05,675 INFO L280 TraceCheckUtils]: 18: Hoare triple {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} is VALID [2020-07-29 03:27:05,678 INFO L280 TraceCheckUtils]: 19: Hoare triple {1943#(and (= 0 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) 1)))} 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; {1944#(and (= 1 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) ULTIMATE.start_substring_~ps~0.offset)))} is VALID [2020-07-29 03:27:05,678 INFO L280 TraceCheckUtils]: 20: Hoare triple {1944#(and (= 1 ULTIMATE.start_substring_~ps~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) ULTIMATE.start_substring_~ps~0.offset)))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {1945#(= 0 |ULTIMATE.start_substring_#t~mem2|)} is VALID [2020-07-29 03:27:05,679 INFO L280 TraceCheckUtils]: 21: Hoare triple {1945#(= 0 |ULTIMATE.start_substring_#t~mem2|)} 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; {1938#false} is VALID [2020-07-29 03:27:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:05,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928776961] [2020-07-29 03:27:05,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100625242] [2020-07-29 03:27:05,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:27:05,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:27:05,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:27:05,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-29 03:27:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:05,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:05,782 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 03:27:05,786 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:27:05,789 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:27:05,789 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:27:05,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-07-29 03:27:06,013 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-07-29 03:27:06,013 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:27:06,024 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:27:06,046 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-29 03:27:06,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2020-07-29 03:27:06,050 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:27:06,051 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_148|, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (= |#memory_int| (let ((.cse0 (store |v_#memory_int_148| ULTIMATE.start_substring_~ps~0.base (store (select |v_#memory_int_148| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)) 0)))) (store .cse0 ULTIMATE.start_main_~nondetString2~0.base (store (select .cse0 ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)))) (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2)) [2020-07-29 03:27:06,051 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2)) [2020-07-29 03:27:06,938 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:27:06,938 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-07-29 03:27:06,940 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-29 03:27:06,961 INFO L624 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2020-07-29 03:27:06,984 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:27:06,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2020-07-29 03:27:06,988 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:27:06,989 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_substring_~ps~0.base))) (and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= (select .cse0 ULTIMATE.start_substring_~ps~0.offset) |ULTIMATE.start_substring_#t~mem2|) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2) (= (select .cse0 (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 2))) 0))) [2020-07-29 03:27:06,989 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |ULTIMATE.start_substring_#t~mem2|) [2020-07-29 03:27:06,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {1937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1937#true} is VALID [2020-07-29 03:27:06,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {1937#true} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {1937#true} is VALID [2020-07-29 03:27:06,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {1937#true} assume !(main_~length1~0 < 1); {1937#true} is VALID [2020-07-29 03:27:06,990 INFO L280 TraceCheckUtils]: 3: Hoare triple {1937#true} assume !(main_~length2~0 < 1); {1937#true} is VALID [2020-07-29 03:27:06,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {1937#true} 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;main_~i~0 := 0; {1961#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:27:06,993 INFO L280 TraceCheckUtils]: 5: Hoare triple {1961#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {1965#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:27:06,995 INFO L280 TraceCheckUtils]: 6: Hoare triple {1965#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {1969#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 03:27:06,996 INFO L280 TraceCheckUtils]: 7: Hoare triple {1969#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length1~0 - 1); {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} is VALID [2020-07-29 03:27:06,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} main_~i~1 := 0; {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} is VALID [2020-07-29 03:27:06,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} is VALID [2020-07-29 03:27:07,024 INFO L280 TraceCheckUtils]: 10: Hoare triple {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} is VALID [2020-07-29 03:27:07,029 INFO L280 TraceCheckUtils]: 11: Hoare triple {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} assume !(main_~i~1 < main_~length2~0 - 1); {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} is VALID [2020-07-29 03:27:07,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {1973#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2))} 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; {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,037 INFO L280 TraceCheckUtils]: 14: Hoare triple {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 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; {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,038 INFO L280 TraceCheckUtils]: 15: Hoare triple {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,039 INFO L280 TraceCheckUtils]: 16: Hoare triple {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 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; {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,040 INFO L280 TraceCheckUtils]: 17: Hoare triple {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,042 INFO L280 TraceCheckUtils]: 18: Hoare triple {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {1989#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 1)))) (<= ULTIMATE.start_main_~length1~0 2))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} 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; {2011#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 2))) 0))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} is VALID [2020-07-29 03:27:07,046 INFO L280 TraceCheckUtils]: 20: Hoare triple {2011#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~length1~0 ULTIMATE.start_substring_~ps~0.offset (- 2))) 0))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_substring_~ps~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))))} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {1945#(= 0 |ULTIMATE.start_substring_#t~mem2|)} is VALID [2020-07-29 03:27:07,047 INFO L280 TraceCheckUtils]: 21: Hoare triple {1945#(= 0 |ULTIMATE.start_substring_#t~mem2|)} 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; {1938#false} is VALID [2020-07-29 03:27:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:27:07,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:27:07,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-29 03:27:07,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156650108] [2020-07-29 03:27:07,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 3 times [2020-07-29 03:27:07,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:07,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119101099] [2020-07-29 03:27:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:07,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:07,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:07,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:07,179 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-07-29 03:27:07,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-29 03:27:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-07-29 03:27:07,226 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 15 states. [2020-07-29 03:27:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:08,210 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2020-07-29 03:27:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:27:08,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-29 03:27:08,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:08,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 65 transitions. [2020-07-29 03:27:08,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:08,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 45 transitions. [2020-07-29 03:27:08,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:27:08,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:27:08,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2020-07-29 03:27:08,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:08,285 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-29 03:27:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2020-07-29 03:27:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-29 03:27:08,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:08,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 45 transitions. Second operand 34 states. [2020-07-29 03:27:08,288 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 45 transitions. Second operand 34 states. [2020-07-29 03:27:08,288 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 34 states. [2020-07-29 03:27:08,289 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:08,291 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-07-29 03:27:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2020-07-29 03:27:08,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:08,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:08,292 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states and 45 transitions. [2020-07-29 03:27:08,292 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states and 45 transitions. [2020-07-29 03:27:08,293 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:08,294 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-07-29 03:27:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2020-07-29 03:27:08,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:08,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:08,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:08,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 03:27:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-07-29 03:27:08,297 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 03:27:08,297 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 03:27:08,297 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:27:08,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-07-29 03:27:08,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:08,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:08,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:08,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:08,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:27:08,299 INFO L794 eck$LassoCheckResult]: Stem: 2103#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2100#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 2101#L532 assume !(main_~length1~0 < 1); 2102#L532-2 assume !(main_~length2~0 < 1); 2097#L535-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;main_~i~0 := 0; 2098#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 2106#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 2107#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 2108#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 2110#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 2085#L541-4 main_~i~1 := 0; 2086#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 2095#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 2096#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 2099#L547-4 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; 2090#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 2083#L517-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; 2084#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 2089#L520-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; 2109#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 2093#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 2094#L524 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; 2091#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 2081#L517-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; 2082#L520-5 [2020-07-29 03:27:08,299 INFO L796 eck$LassoCheckResult]: Loop: 2082#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 2087#L520-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; 2104#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 2082#L520-5 [2020-07-29 03:27:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1546919447, now seen corresponding path program 3 times [2020-07-29 03:27:08,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:08,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456154647] [2020-07-29 03:27:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:08,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:08,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:08,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 4 times [2020-07-29 03:27:08,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:08,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162618018] [2020-07-29 03:27:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:08,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:08,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:08,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 721898201, now seen corresponding path program 1 times [2020-07-29 03:27:08,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:08,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167010004] [2020-07-29 03:27:08,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:08,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:08,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:08,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:09,894 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 236 DAG size of output: 179 [2020-07-29 03:27:10,343 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-07-29 03:27:10,348 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:10,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:10,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:10,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:10,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:10,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:10,349 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:10,349 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:10,349 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration10_Lasso [2020-07-29 03:27:10,349 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:10,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:10,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:10,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,361 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 110 [2020-07-29 03:27:11,641 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2020-07-29 03:27:11,643 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 03:27:11,644 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:27:11,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:11,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:12,303 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-07-29 03:27:13,731 WARN L193 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2020-07-29 03:27:14,112 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:14,113 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,116 INFO L120 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 [2020-07-29 03:27:14,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,144 INFO L120 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 [2020-07-29 03:27:14,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,172 INFO L120 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 [2020-07-29 03:27:14,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,201 INFO L120 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 [2020-07-29 03:27:14,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:14,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:14,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,230 INFO L120 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 [2020-07-29 03:27:14,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,257 INFO L120 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 [2020-07-29 03:27:14,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,282 INFO L120 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 [2020-07-29 03:27:14,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:14,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:14,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,311 INFO L120 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 [2020-07-29 03:27:14,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,343 INFO L120 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 [2020-07-29 03:27:14,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,370 INFO L120 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 [2020-07-29 03:27:14,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:14,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:14,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:14,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,396 INFO L120 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 [2020-07-29 03:27:14,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:14,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:14,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:14,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:14,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:14,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:14,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:14,532 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2020-07-29 03:27:14,533 INFO L444 ModelExtractionUtils]: 13 out of 52 variables were initially zero. Simplification set additionally 36 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:14,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:27:14,536 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:27:14,537 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:14,537 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_5 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2020-07-29 03:27:14,849 INFO L297 tatePredicateManager]: 43 out of 44 supporting invariants were superfluous and have been removed [2020-07-29 03:27:14,854 INFO L393 LassoCheck]: Loop: "call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3;" "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;" "assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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;" [2020-07-29 03:27:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:14,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:27:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:14,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:27:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:14,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:15,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {2299#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2299#unseeded} is VALID [2020-07-29 03:27:15,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {2299#unseeded} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {2299#unseeded} is VALID [2020-07-29 03:27:15,001 INFO L280 TraceCheckUtils]: 2: Hoare triple {2299#unseeded} assume !(main_~length1~0 < 1); {2299#unseeded} is VALID [2020-07-29 03:27:15,002 INFO L280 TraceCheckUtils]: 3: Hoare triple {2299#unseeded} assume !(main_~length2~0 < 1); {2299#unseeded} is VALID [2020-07-29 03:27:15,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {2299#unseeded} 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;main_~i~0 := 0; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,006 INFO L280 TraceCheckUtils]: 7: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,013 INFO L280 TraceCheckUtils]: 9: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,014 INFO L280 TraceCheckUtils]: 10: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_~i~1 := 0; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,015 INFO L280 TraceCheckUtils]: 11: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,016 INFO L280 TraceCheckUtils]: 13: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,017 INFO L280 TraceCheckUtils]: 14: Hoare triple {2554#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,018 INFO L280 TraceCheckUtils]: 15: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,019 INFO L280 TraceCheckUtils]: 16: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,019 INFO L280 TraceCheckUtils]: 17: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,020 INFO L280 TraceCheckUtils]: 18: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,021 INFO L280 TraceCheckUtils]: 19: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,021 INFO L280 TraceCheckUtils]: 20: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,022 INFO L280 TraceCheckUtils]: 21: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,023 INFO L280 TraceCheckUtils]: 22: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,024 INFO L280 TraceCheckUtils]: 23: Hoare triple {2585#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2533#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:27:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:15,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} 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; {2616#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps2~0.base)) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,088 INFO L280 TraceCheckUtils]: 2: Hoare triple {2616#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps2~0.base)) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; {2536#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:15,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:27:15,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:15,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,120 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:27:15,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-07-29 03:27:15,315 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 52 states and 66 transitions. Complement of second has 9 states. [2020-07-29 03:27:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:15,316 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:15,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:27:15,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:15,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:15,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:27:15,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:15,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:15,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:15,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 66 transitions. [2020-07-29 03:27:15,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:15,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:15,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:15,319 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:27:15,320 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:15,320 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:27:15,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:15,321 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:15,321 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 52 states and 66 transitions. cyclomatic complexity: 20 [2020-07-29 03:27:15,322 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:15,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:27:15,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:27:15,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:27:15,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:15,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:15,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:15,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:15,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:15,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:15,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,337 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:27:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-29 03:27:15,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,338 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:27:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:27:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:15,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {2299#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2299#unseeded} is VALID [2020-07-29 03:27:15,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {2299#unseeded} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {2299#unseeded} is VALID [2020-07-29 03:27:15,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {2299#unseeded} assume !(main_~length1~0 < 1); {2299#unseeded} is VALID [2020-07-29 03:27:15,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {2299#unseeded} assume !(main_~length2~0 < 1); {2299#unseeded} is VALID [2020-07-29 03:27:15,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {2299#unseeded} 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;main_~i~0 := 0; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,463 INFO L280 TraceCheckUtils]: 5: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,464 INFO L280 TraceCheckUtils]: 6: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,468 INFO L280 TraceCheckUtils]: 7: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,469 INFO L280 TraceCheckUtils]: 8: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,470 INFO L280 TraceCheckUtils]: 9: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,470 INFO L280 TraceCheckUtils]: 10: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_~i~1 := 0; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,471 INFO L280 TraceCheckUtils]: 11: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,472 INFO L280 TraceCheckUtils]: 12: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,472 INFO L280 TraceCheckUtils]: 13: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,474 INFO L280 TraceCheckUtils]: 14: Hoare triple {2705#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,475 INFO L280 TraceCheckUtils]: 16: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,476 INFO L280 TraceCheckUtils]: 17: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,477 INFO L280 TraceCheckUtils]: 18: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,479 INFO L280 TraceCheckUtils]: 21: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,480 INFO L280 TraceCheckUtils]: 22: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,480 INFO L280 TraceCheckUtils]: 23: Hoare triple {2736#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2533#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:27:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:15,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} 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; {2767#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps2~0.base)) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {2767#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps2~0.base)) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; {2536#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:15,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:27:15,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:15,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,556 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:27:15,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-07-29 03:27:15,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 52 states and 66 transitions. Complement of second has 9 states. [2020-07-29 03:27:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:15,739 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:15,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:27:15,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:15,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:15,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:27:15,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:15,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:15,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:15,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 66 transitions. [2020-07-29 03:27:15,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:15,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:15,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:15,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:27:15,744 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:15,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:27:15,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:15,747 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:15,747 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 52 states and 66 transitions. cyclomatic complexity: 20 [2020-07-29 03:27:15,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:15,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:27:15,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:27:15,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:27:15,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:15,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:15,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:15,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:15,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:15,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:15,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:15,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:15,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 66 transitions. cyclomatic complexity: 20 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:15,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,762 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:27:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-29 03:27:15,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,763 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:27:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:27:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:15,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {2299#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2299#unseeded} is VALID [2020-07-29 03:27:15,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {2299#unseeded} 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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; {2299#unseeded} is VALID [2020-07-29 03:27:15,898 INFO L280 TraceCheckUtils]: 2: Hoare triple {2299#unseeded} assume !(main_~length1~0 < 1); {2299#unseeded} is VALID [2020-07-29 03:27:15,900 INFO L280 TraceCheckUtils]: 3: Hoare triple {2299#unseeded} assume !(main_~length2~0 < 1); {2299#unseeded} is VALID [2020-07-29 03:27:15,902 INFO L280 TraceCheckUtils]: 4: Hoare triple {2299#unseeded} 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;main_~i~0 := 0; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,904 INFO L280 TraceCheckUtils]: 5: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,906 INFO L280 TraceCheckUtils]: 7: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,907 INFO L280 TraceCheckUtils]: 8: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,907 INFO L280 TraceCheckUtils]: 9: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,908 INFO L280 TraceCheckUtils]: 10: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_~i~1 := 0; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,908 INFO L280 TraceCheckUtils]: 11: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,909 INFO L280 TraceCheckUtils]: 12: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,909 INFO L280 TraceCheckUtils]: 13: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,910 INFO L280 TraceCheckUtils]: 14: Hoare triple {2856#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,911 INFO L280 TraceCheckUtils]: 16: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,912 INFO L280 TraceCheckUtils]: 17: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,913 INFO L280 TraceCheckUtils]: 18: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,914 INFO L280 TraceCheckUtils]: 19: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,915 INFO L280 TraceCheckUtils]: 20: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,916 INFO L280 TraceCheckUtils]: 21: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,917 INFO L280 TraceCheckUtils]: 22: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,917 INFO L280 TraceCheckUtils]: 23: Hoare triple {2887#(and (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} 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; {2533#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 03:27:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:27:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:15,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:15,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {2534#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} 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; {2918#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps2~0.base)) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {2918#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) (select |#length| ULTIMATE.start_substring_~ps2~0.base)) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; {2536#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:27:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:15,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:27:15,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:15,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:15,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:15,998 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:27:15,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-07-29 03:27:16,183 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 60 states and 78 transitions. Complement of second has 8 states. [2020-07-29 03:27:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:16,184 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:16,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:27:16,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:16,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:16,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:27:16,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:16,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:16,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:16,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2020-07-29 03:27:16,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:16,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:16,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:16,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:27:16,187 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:16,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:27:16,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:16,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:16,188 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 78 transitions. cyclomatic complexity: 25 [2020-07-29 03:27:16,189 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:27:16,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:16,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:16,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:16,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:16,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:16,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:16,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:27:16,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:27:16,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:27:16,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:16,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:16,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:27:16,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:16,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:16,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:27:16,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:16,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:16,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:16,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:16,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:16,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:27:16,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:16,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:16,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:16,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:27:16,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:27:16,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:27:16,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 3 letters. [2020-07-29 03:27:16,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 28 letters. Loop has 3 letters. [2020-07-29 03:27:16,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 28 letters. Loop has 3 letters. [2020-07-29 03:27:16,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 78 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:27:16,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,205 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:27:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-29 03:27:16,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:27:16,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:27:16,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 24 letters. Loop has 6 letters. [2020-07-29 03:27:16,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:16,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. cyclomatic complexity: 25 [2020-07-29 03:27:16,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:16,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 66 transitions. [2020-07-29 03:27:16,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:27:16,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:27:16,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2020-07-29 03:27:16,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:16,211 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2020-07-29 03:27:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2020-07-29 03:27:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-29 03:27:16,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:16,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 66 transitions. Second operand 49 states. [2020-07-29 03:27:16,215 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 66 transitions. Second operand 49 states. [2020-07-29 03:27:16,215 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 49 states. [2020-07-29 03:27:16,215 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:16,217 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2020-07-29 03:27:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2020-07-29 03:27:16,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:16,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:16,218 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states and 66 transitions. [2020-07-29 03:27:16,219 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states and 66 transitions. [2020-07-29 03:27:16,219 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:16,221 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2020-07-29 03:27:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2020-07-29 03:27:16,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:16,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:16,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:16,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 03:27:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2020-07-29 03:27:16,224 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-07-29 03:27:16,224 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2020-07-29 03:27:16,224 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:27:16,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2020-07-29 03:27:16,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:27:16,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:16,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:16,225 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:16,226 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:27:16,226 INFO L794 eck$LassoCheckResult]: Stem: 3020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3017#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 3018#L532 assume !(main_~length1~0 < 1); 3019#L532-2 assume !(main_~length2~0 < 1); 3014#L535-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;main_~i~0 := 0; 3015#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 3024#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 3025#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 3027#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 3028#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 3001#L541-4 main_~i~1 := 0; 3002#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 3012#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 3013#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 3016#L547-4 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; 3009#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 3010#L517-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; 3043#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 3035#L520-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; 3029#L520-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3; 3007#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 3008#L524 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; 3011#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 2997#L517-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; 2998#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 3004#L520-1 [2020-07-29 03:27:16,226 INFO L796 eck$LassoCheckResult]: Loop: 3004#L520-1 assume !substring_#t~short6; 3021#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; 3003#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 3004#L520-1 [2020-07-29 03:27:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash -709862543, now seen corresponding path program 4 times [2020-07-29 03:27:16,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:16,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805869269] [2020-07-29 03:27:16,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:16,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:16,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:16,266 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash 92531, now seen corresponding path program 1 times [2020-07-29 03:27:16,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:16,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075170967] [2020-07-29 03:27:16,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:16,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {3263#true} assume !substring_#t~short6; {3265#(not |ULTIMATE.start_substring_#t~short6|)} is VALID [2020-07-29 03:27:16,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {3265#(not |ULTIMATE.start_substring_#t~short6|)} assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;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; {3264#false} is VALID [2020-07-29 03:27:16,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {3264#false} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {3264#false} is VALID [2020-07-29 03:27:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:16,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075170967] [2020-07-29 03:27:16,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:16,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:27:16,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766335365] [2020-07-29 03:27:16,286 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:27:16,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:16,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:27:16,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:27:16,287 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-07-29 03:27:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:16,329 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-29 03:27:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:27:16,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:27:16,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:16,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2020-07-29 03:27:16,334 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:16,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2020-07-29 03:27:16,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:27:16,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:27:16,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:27:16,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:16,335 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:16,336 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:16,336 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:16,336 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 03:27:16,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:27:16,336 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:16,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:27:16,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:27:16 BoogieIcfgContainer [2020-07-29 03:27:16,343 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:27:16,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:27:16,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:27:16,344 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:27:16,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:44" (3/4) ... [2020-07-29 03:27:16,348 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:27:16,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:27:16,350 INFO L168 Benchmark]: Toolchain (without parser) took 32967.56 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 541.1 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -380.2 MB). Peak memory consumption was 160.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:16,351 INFO L168 Benchmark]: CDTParser took 1.04 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:16,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:16,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:16,352 INFO L168 Benchmark]: Boogie Preprocessor took 45.61 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. [2020-07-29 03:27:16,352 INFO L168 Benchmark]: RCFGBuilder took 545.03 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:16,353 INFO L168 Benchmark]: BuchiAutomizer took 31625.89 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 403.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -255.4 MB). Peak memory consumption was 148.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:16,353 INFO L168 Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:16,355 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 682.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.61 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 545.03 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31625.89 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 403.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -255.4 MB). Peak memory consumption was 148.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[ps] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * ps2 and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps2 and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.5s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 25.8s. Construction of modules took 0.8s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 241 SDtfs, 441 SDslu, 504 SDs, 0 SdLazy, 453 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital294 mio100 ax108 hnf98 lsp88 ukn69 mio100 lsp50 div100 bol100 ite100 ukn100 eq183 hnf89 smp97 dnf139 smp93 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 168ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 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...