./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/substring-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 29f46a81991b9bc0fef856343662e1cc264d2d45 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 01:37:12,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:37:12,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:37:12,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:37:12,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:37:12,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:37:12,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:37:12,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:37:12,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:37:12,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:37:12,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:37:12,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:37:12,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:37:12,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:37:12,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:37:12,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:37:12,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:37:12,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:37:12,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:37:12,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:37:12,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:37:12,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:37:12,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:37:12,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:37:12,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:37:12,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:37:12,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:37:12,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:37:12,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:37:12,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:37:12,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:37:12,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:37:12,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:37:12,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:37:12,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:37:12,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:37:12,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:37:12,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:37:12,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:37:12,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:37:12,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:37:12,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:37:12,639 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:37:12,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:37:12,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:37:12,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:37:12,641 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:37:12,641 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:37:12,641 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:37:12,641 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:37:12,642 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:37:12,642 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:37:12,642 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:37:12,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:37:12,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:37:12,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:37:12,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:37:12,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:37:12,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:37:12,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:37:12,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:37:12,644 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:37:12,644 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:37:12,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:37:12,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:37:12,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:37:12,645 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:37:12,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:37:12,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:37:12,646 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:37:12,646 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:37:12,647 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:37:12,647 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29f46a81991b9bc0fef856343662e1cc264d2d45 [2020-07-29 01:37:12,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:37:12,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:37:12,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:37:12,978 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:37:12,981 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:37:12,983 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2020-07-29 01:37:13,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101ff96b3/ee33c75dcac0492990e38d6afaa85af9/FLAG874420ee8 [2020-07-29 01:37:13,536 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:37:13,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2020-07-29 01:37:13,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101ff96b3/ee33c75dcac0492990e38d6afaa85af9/FLAG874420ee8 [2020-07-29 01:37:13,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101ff96b3/ee33c75dcac0492990e38d6afaa85af9 [2020-07-29 01:37:13,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:37:13,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:37:13,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:13,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:37:13,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:37:13,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:13" (1/1) ... [2020-07-29 01:37:13,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432c8d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:13, skipping insertion in model container [2020-07-29 01:37:13,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:13" (1/1) ... [2020-07-29 01:37:13,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:37:13,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:14,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:14,385 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:14,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:14,516 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:14,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14 WrapperNode [2020-07-29 01:37:14,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:14,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:14,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:14,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:14,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:14,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:14,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:14,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:14,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (1/1) ... [2020-07-29 01:37:14,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:14,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:14,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:14,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:14,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (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 01:37:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:37:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:37:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:37:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:15,124 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:15,124 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:37:15,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:15 BoogieIcfgContainer [2020-07-29 01:37:15,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:15,129 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:15,129 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:15,133 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:15,134 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:15,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:37:13" (1/3) ... [2020-07-29 01:37:15,135 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@359be8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:15, skipping insertion in model container [2020-07-29 01:37:15,135 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:15,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:14" (2/3) ... [2020-07-29 01:37:15,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@359be8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:15, skipping insertion in model container [2020-07-29 01:37:15,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:15,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:15" (3/3) ... [2020-07-29 01:37:15,138 INFO L371 chiAutomizerObserver]: Analyzing ICFG substring-alloca-1.i [2020-07-29 01:37:15,196 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:15,197 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:15,197 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:15,197 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:15,198 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:15,198 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:15,198 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:15,198 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:15,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:37:15,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:37:15,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:15,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:15,242 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:15,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:37:15,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:37:15,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,247 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:15,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:15,256 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 8#L568-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 4#L550-3true [2020-07-29 01:37:15,256 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 19#L550-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 3#L553-5true assume !true; 5#L553-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 6#L557true 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; 4#L550-3true [2020-07-29 01:37:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:15,264 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:37:15,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:15,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839502854] [2020-07-29 01:37:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,462 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2020-07-29 01:37:15,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:15,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101267578] [2020-07-29 01:37:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:15,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {23#true} is VALID [2020-07-29 01:37:15,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#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; {23#true} is VALID [2020-07-29 01:37:15,517 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-29 01:37:15,518 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#false} call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); {24#false} is VALID [2020-07-29 01:37:15,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#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; {24#false} is VALID [2020-07-29 01:37:15,521 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 01:37:15,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101267578] [2020-07-29 01:37:15,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:15,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:37:15,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96091531] [2020-07-29 01:37:15,528 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:37:15,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:37:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:37:15,543 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-07-29 01:37:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:15,584 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 01:37:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:37:15,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:37:15,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:15,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2020-07-29 01:37:15,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:37:15,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2020-07-29 01:37:15,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:37:15,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:37:15,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 01:37:15,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:15,613 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:37:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 01:37:15,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:37:15,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:15,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 01:37:15,642 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 01:37:15,644 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 01:37:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:15,646 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:37:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:37:15,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:15,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:15,648 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 01:37:15,648 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 01:37:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:15,650 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:37:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:37:15,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:15,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:15,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:15,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:37:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:37:15,655 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:37:15,655 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:37:15,655 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:37:15,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:37:15,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:37:15,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:15,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:15,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:15,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:15,658 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 44#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 45#L565 assume !(main_~length1~0 < 1); 49#L565-2 assume !(main_~length2~0 < 1); 50#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 51#L550-3 [2020-07-29 01:37:15,658 INFO L796 eck$LassoCheckResult]: Loop: 51#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 52#L550-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; 42#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 43#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L553-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; 46#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 47#L557 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; 51#L550-3 [2020-07-29 01:37:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:37:15,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:15,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261876853] [2020-07-29 01:37:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2020-07-29 01:37:15,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:15,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705495729] [2020-07-29 01:37:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2020-07-29 01:37:15,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:15,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116207436] [2020-07-29 01:37:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:15,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:15,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:16,178 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-07-29 01:37:16,658 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2020-07-29 01:37:16,816 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-07-29 01:37:16,830 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:16,831 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:16,831 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:16,831 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:16,831 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:16,832 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:16,832 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:16,832 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:16,832 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration2_Lasso [2020-07-29 01:37:16,832 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:16,833 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:16,892 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 01:37:17,295 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-07-29 01:37:17,470 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-07-29 01:37:17,478 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 01:37:17,483 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 01:37:17,486 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 01:37:17,491 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 01:37:17,495 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 01:37:17,500 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 01:37:17,505 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 01:37:17,509 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 01:37:17,513 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 01:37:17,518 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 01:37:17,522 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 01:37:17,526 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 01:37:17,530 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 01:37:17,534 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 01:37:17,537 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 01:37:17,547 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 01:37:17,550 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 01:37:17,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 01:37:17,564 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 01:37:17,568 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 01:37:17,572 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 01:37:17,601 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 01:37:18,372 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2020-07-29 01:37:18,743 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:18,751 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) [2020-07-29 01:37:18,772 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 01:37:18,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:18,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:18,807 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) [2020-07-29 01:37:18,839 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 01:37:18,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:18,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,843 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 01:37:18,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,860 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-07-29 01:37:18,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:18,876 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,911 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 01:37:18,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:18,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:18,921 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) [2020-07-29 01:37:18,955 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:18,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:18,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:18,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:18,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:18,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:18,963 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) [2020-07-29 01:37:19,002 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:19,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:19,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:19,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:19,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:19,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:19,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:19,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:19,008 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 01:37:19,065 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 01:37:19,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:19,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:19,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:19,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:19,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:19,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:19,102 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 01:37:19,157 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 01:37:19,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:19,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:19,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:19,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:19,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:19,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:19,167 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) [2020-07-29 01:37:19,214 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 01:37:19,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:19,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:19,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:19,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:19,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:19,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:19,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:19,273 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:37:19,273 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 7 variables to zero. 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 01:37:19,282 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:19,298 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:19,298 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:19,299 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 01:37:19,398 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-07-29 01:37:19,404 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~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;" "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 01:37:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:37:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {87#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {87#unseeded} is VALID [2020-07-29 01:37:19,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {87#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~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {87#unseeded} is VALID [2020-07-29 01:37:19,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {87#unseeded} assume !(main_~length1~0 < 1); {87#unseeded} is VALID [2020-07-29 01:37:19,496 INFO L280 TraceCheckUtils]: 3: Hoare triple {87#unseeded} assume !(main_~length2~0 < 1); {87#unseeded} is VALID [2020-07-29 01:37:19,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {87#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;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; {87#unseeded} is VALID [2020-07-29 01:37:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:37:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:19,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:19,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#(>= 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); {157#(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 01:37:19,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {157#(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; {157#(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 01:37:19,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {157#(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; {157#(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 01:37:19,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {157#(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; {157#(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 01:37:19,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {157#(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~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; {157#(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 01:37:19,564 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(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); {157#(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 01:37:19,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {157#(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; {140#(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 01:37:19,567 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 01:37:19,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:19,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:19,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,588 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 01:37:19,589 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:37:19,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2020-07-29 01:37:19,681 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 01:37:19,682 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 01:37:19,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:37:19,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:19,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:37:19,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,692 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 01:37:19,694 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:37:19,695 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:37:19,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:19,699 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:19,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:19,701 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:19,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:19,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:19,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:19,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:19,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:19,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:37:19,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:19,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:19,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:37:19,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:19,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:19,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:19,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:37:19,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:37:19,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:37:19,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:19,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:19,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:19,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:19,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:19,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:19,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:37:19,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:37:19,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:37:19,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:37:19,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:37:19,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:37:19,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:19,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:19,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:19,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:19,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:19,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:19,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:19,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:19,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:19,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:19,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,747 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:37:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-29 01:37:19,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:19,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:37:19,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2020-07-29 01:37:19,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:19,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:19,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2020-07-29 01:37:19,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:37:19,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:37:19,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2020-07-29 01:37:19,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:19,762 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 01:37:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2020-07-29 01:37:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 01:37:19,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:19,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 01:37:19,764 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 01:37:19,765 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 01:37:19,765 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:19,770 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 01:37:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 01:37:19,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:19,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:19,773 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 24 transitions. [2020-07-29 01:37:19,773 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 24 transitions. [2020-07-29 01:37:19,774 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:19,776 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 01:37:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 01:37:19,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:19,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:19,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:19,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:37:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-07-29 01:37:19,780 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 01:37:19,781 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 01:37:19,781 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:37:19,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 01:37:19,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:19,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:19,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:19,784 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:19,784 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:19,785 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 201#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 202#L565 assume !(main_~length1~0 < 1); 214#L565-2 assume !(main_~length2~0 < 1); 215#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 209#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 211#L550-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; 203#L553-5 [2020-07-29 01:37:19,785 INFO L796 eck$LassoCheckResult]: Loop: 203#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 204#L553-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; 216#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 203#L553-5 [2020-07-29 01:37:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2020-07-29 01:37:19,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:19,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932238103] [2020-07-29 01:37:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:19,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:19,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:19,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2020-07-29 01:37:19,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:19,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709111946] [2020-07-29 01:37:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:19,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:19,915 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:19,920 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2020-07-29 01:37:19,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:19,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346678291] [2020-07-29 01:37:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:19,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:19,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:19,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:20,104 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-07-29 01:37:20,642 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 100 [2020-07-29 01:37:20,825 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-07-29 01:37:20,831 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:20,831 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:20,831 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:20,831 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:20,832 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:20,832 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:20,832 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:20,832 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:20,832 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration3_Lasso [2020-07-29 01:37:20,833 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:20,833 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:20,864 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 01:37:20,874 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 01:37:20,879 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 01:37:20,885 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 01:37:20,892 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 01:37:20,900 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 01:37:20,904 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 01:37:20,910 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 01:37:20,913 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 01:37:20,918 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 01:37:20,923 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 01:37:20,927 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 01:37:20,931 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 01:37:20,936 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 01:37:20,941 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 01:37:20,944 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 01:37:20,947 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 01:37:20,951 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 01:37:20,957 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 01:37:20,962 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 01:37:20,968 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 01:37:21,505 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-07-29 01:37:21,689 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-07-29 01:37:21,697 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 01:37:21,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 01:37:21,704 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 01:37:22,414 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-07-29 01:37:23,102 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:23,103 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:37:23,113 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 01:37:23,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,119 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 01:37:23,151 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 01:37:23,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,155 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 01:37:23,177 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 01:37:23,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:23,185 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 01:37:23,210 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 01:37:23,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,215 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,236 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 01:37:23,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,240 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 01:37:23,263 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 01:37:23,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,267 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,296 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 01:37:23,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,300 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 01:37:23,324 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 01:37:23,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,329 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 01:37:23,374 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 01:37:23,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:23,382 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 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 01:37:23,416 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 01:37:23,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,425 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,449 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 01:37:23,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,454 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 01:37:23,477 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 01:37:23,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:23,487 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 01:37:23,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 01:37:23,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,532 INFO L402 nArgumentSynthesizer]: A total of 0 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 01:37:23,540 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 01:37:23,571 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 01:37:23,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:23,578 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 01:37:23,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 01:37:23,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,615 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 01:37:23,639 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 01:37:23,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,643 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,665 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 01:37:23,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,668 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 01:37:23,692 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 01:37:23,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,696 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,719 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 01:37:23,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:23,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:23,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:23,722 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,746 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 01:37:23,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:23,753 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 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 01:37:23,783 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 01:37:23,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:23,811 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) [2020-07-29 01:37:23,860 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 01:37:23,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:23,871 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 01:37:23,904 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 01:37:23,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,906 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:37:23,906 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:37:23,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,918 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:37:23,918 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:37:23,936 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 01:37:23,958 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 01:37:23,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:23,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:23,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:23,966 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 01:37:23,996 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 01:37:23,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:23,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:23,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:23,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:24,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:24,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:24,004 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 01:37:24,038 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 01:37:24,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:24,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:24,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:24,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:24,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:24,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:24,052 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 01:37:24,075 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 01:37:24,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:24,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:24,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:24,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:24,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:24,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:24,102 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 01:37:24,128 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 01:37:24,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:24,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:24,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:24,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:24,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:24,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:24,168 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:24,256 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2020-07-29 01:37:24,256 INFO L444 ModelExtractionUtils]: 13 out of 55 variables were initially zero. Simplification set additionally 39 variables to zero. 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) [2020-07-29 01:37:24,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:24,264 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:24,264 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:24,264 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2020-07-29 01:37:24,422 INFO L297 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2020-07-29 01:37:24,432 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~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset;" [2020-07-29 01:37:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:24,439 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:37:24,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:24,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-29 01:37:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:24,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:24,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {303#unseeded} is VALID [2020-07-29 01:37:24,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {303#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~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {303#unseeded} is VALID [2020-07-29 01:37:24,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#unseeded} assume !(main_~length1~0 < 1); {303#unseeded} is VALID [2020-07-29 01:37:24,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {303#unseeded} assume !(main_~length2~0 < 1); {303#unseeded} is VALID [2020-07-29 01:37:24,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {303#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;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; {454#(and (<= ULTIMATE.start_substring_~ps~0.offset 0) (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 0 ULTIMATE.start_substring_~t.offset) unseeded)} is VALID [2020-07-29 01:37:24,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {454#(and (<= ULTIMATE.start_substring_~ps~0.offset 0) (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 0 ULTIMATE.start_substring_~t.offset) unseeded)} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {458#(and (<= ULTIMATE.start_substring_~ps~0.offset 0) (<= 0 ULTIMATE.start_substring_~ps~0.offset) (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 0 ULTIMATE.start_substring_~t.offset) unseeded)} is VALID [2020-07-29 01:37:24,652 INFO L280 TraceCheckUtils]: 6: Hoare triple {458#(and (<= ULTIMATE.start_substring_~ps~0.offset 0) (<= 0 ULTIMATE.start_substring_~ps~0.offset) (= ULTIMATE.start_substring_~t.base |ULTIMATE.start_main_#t~malloc14.base|) (= 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; {433#(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 01:37:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:24,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 01:37:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:24,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:24,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#(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; {462#(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 01:37:24,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {462#(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; {462#(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 01:37:24,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {462#(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~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; {436#(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 01:37:24,710 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 01:37:24,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:37:24,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:24,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,735 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 01:37:24,735 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 01:37:24,866 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 40 states and 54 transitions. Complement of second has 6 states. [2020-07-29 01:37:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:24,866 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:24,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:24,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:24,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:24,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:37:24,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:24,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:24,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:24,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2020-07-29 01:37:24,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:24,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:24,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:24,871 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:24,872 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:24,872 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:37:24,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:37:24,873 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:24,874 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 54 transitions. cyclomatic complexity: 18 [2020-07-29 01:37:24,875 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:24,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:24,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:24,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:24,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:24,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:24,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:24,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:24,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:37:24,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:37:24,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:37:24,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:37:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:24,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:37:24,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:24,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:24,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:24,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:24,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:24,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:24,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:24,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:24,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:24,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:24,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:24,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 54 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:24,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,892 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:37:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-29 01:37:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:37:24,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:37:24,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:24,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. cyclomatic complexity: 18 [2020-07-29 01:37:24,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:24,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 38 transitions. [2020-07-29 01:37:24,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:37:24,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:37:24,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2020-07-29 01:37:24,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:24,901 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-29 01:37:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2020-07-29 01:37:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2020-07-29 01:37:24,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:24,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 38 transitions. Second operand 23 states. [2020-07-29 01:37:24,904 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 38 transitions. Second operand 23 states. [2020-07-29 01:37:24,904 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 23 states. [2020-07-29 01:37:24,905 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:24,908 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-07-29 01:37:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-29 01:37:24,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:24,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:24,909 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 28 states and 38 transitions. [2020-07-29 01:37:24,909 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 28 states and 38 transitions. [2020-07-29 01:37:24,910 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:24,912 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-07-29 01:37:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-29 01:37:24,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:24,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:24,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:24,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:37:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2020-07-29 01:37:24,915 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-07-29 01:37:24,915 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-07-29 01:37:24,915 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:37:24,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:37:24,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:24,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:24,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:24,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:24,918 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:24,918 INFO L794 eck$LassoCheckResult]: Stem: 532#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 519#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 520#L565 assume !(main_~length1~0 < 1); 533#L565-2 assume !(main_~length2~0 < 1); 534#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 527#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 528#L550-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; 539#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 536#L553-1 assume !substring_#t~short6; 537#L553-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; 525#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 526#L557 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; 529#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 531#L550-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; 521#L553-5 [2020-07-29 01:37:24,918 INFO L796 eck$LassoCheckResult]: Loop: 521#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 522#L553-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; 535#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 521#L553-5 [2020-07-29 01:37:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2020-07-29 01:37:24,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:24,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595237106] [2020-07-29 01:37:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:24,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {659#true} is VALID [2020-07-29 01:37:24,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#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~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {659#true} is VALID [2020-07-29 01:37:24,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {659#true} assume !(main_~length1~0 < 1); {659#true} is VALID [2020-07-29 01:37:24,984 INFO L280 TraceCheckUtils]: 3: Hoare triple {659#true} assume !(main_~length2~0 < 1); {659#true} is VALID [2020-07-29 01:37:24,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {659#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;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; {659#true} is VALID [2020-07-29 01:37:24,985 INFO L280 TraceCheckUtils]: 5: Hoare triple {659#true} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {659#true} is VALID [2020-07-29 01:37:24,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {659#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; {659#true} is VALID [2020-07-29 01:37:24,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {659#true} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {661#(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 01:37:24,988 INFO L280 TraceCheckUtils]: 8: Hoare triple {661#(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; {662#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 01:37:24,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {662#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; {662#(= 0 (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) ULTIMATE.start_substring_~pt~0.offset))} is VALID [2020-07-29 01:37:24,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {662#(= 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); {663#(= 0 |ULTIMATE.start_substring_#t~mem9|)} is VALID [2020-07-29 01:37:24,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {663#(= 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; {660#false} is VALID [2020-07-29 01:37:24,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#false} call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); {660#false} is VALID [2020-07-29 01:37:24,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {660#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; {660#false} is VALID [2020-07-29 01:37:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:24,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595237106] [2020-07-29 01:37:24,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:24,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:37:24,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982042524] [2020-07-29 01:37:24,993 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:37:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2020-07-29 01:37:24,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:24,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197948282] [2020-07-29 01:37:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:24,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:25,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:37:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:37:25,149 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 01:37:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:25,242 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-07-29 01:37:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:37:25,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:37:25,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:25,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-07-29 01:37:25,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:37:25,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 34 transitions. [2020-07-29 01:37:25,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:37:25,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:37:25,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-07-29 01:37:25,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:25,269 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-29 01:37:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-07-29 01:37:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-29 01:37:25,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:25,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 34 transitions. Second operand 24 states. [2020-07-29 01:37:25,272 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 34 transitions. Second operand 24 states. [2020-07-29 01:37:25,272 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 24 states. [2020-07-29 01:37:25,273 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:25,276 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-07-29 01:37:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-29 01:37:25,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:25,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:25,277 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states and 34 transitions. [2020-07-29 01:37:25,277 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states and 34 transitions. [2020-07-29 01:37:25,278 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:25,282 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-07-29 01:37:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-29 01:37:25,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:25,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:25,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:25,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:37:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-07-29 01:37:25,287 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-07-29 01:37:25,287 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-07-29 01:37:25,287 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:37:25,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2020-07-29 01:37:25,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:25,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:25,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:25,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:25,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:25,291 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 697#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 698#L565 assume !(main_~length1~0 < 1); 704#L565-2 assume !(main_~length2~0 < 1); 705#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 706#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 707#L550-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; 716#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 718#L553-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; 717#L553-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; 711#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 712#L557 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; 708#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 710#L550-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; 699#L553-5 [2020-07-29 01:37:25,291 INFO L796 eck$LassoCheckResult]: Loop: 699#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 700#L553-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; 713#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 699#L553-5 [2020-07-29 01:37:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2020-07-29 01:37:25,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:25,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558163744] [2020-07-29 01:37:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2020-07-29 01:37:25,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:25,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101219460] [2020-07-29 01:37:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,400 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:25,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2020-07-29 01:37:25,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:25,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110804032] [2020-07-29 01:37:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:25,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:25,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:26,380 WARN L193 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 139 [2020-07-29 01:37:26,615 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-29 01:37:26,618 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:26,619 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:26,619 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:26,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:26,619 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:26,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:26,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:26,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:26,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration5_Lasso [2020-07-29 01:37:26,620 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:26,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:26,653 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 01:37:26,658 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 01:37:26,660 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 01:37:26,664 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 01:37:26,671 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 01:37:26,674 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 01:37:26,677 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 01:37:26,681 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 01:37:27,349 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2020-07-29 01:37:27,577 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2020-07-29 01:37:27,587 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 01:37:27,592 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 01:37:27,596 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 01:37:27,600 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 01:37:27,604 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 01:37:27,607 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 01:37:27,611 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 01:37:27,618 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 01:37:27,620 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 01:37:27,627 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 01:37:27,636 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 01:37:27,638 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 01:37:27,647 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 01:37:27,650 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 01:37:27,655 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 01:37:28,335 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-07-29 01:37:29,138 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-07-29 01:37:29,474 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:29,475 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:37:29,478 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 01:37:29,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:29,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:29,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:29,482 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 01:37:29,504 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 01:37:29,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:29,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:29,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:29,512 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 01:37:29,534 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 01:37:29,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:29,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:29,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:29,538 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 01:37:29,561 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 01:37:29,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:29,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:29,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:29,574 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) [2020-07-29 01:37:29,598 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:29,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:29,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:29,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:29,602 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) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:29,623 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 01:37:29,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:29,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:29,630 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 01:37:29,653 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 01:37:29,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:29,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:29,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:29,656 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:29,680 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:29,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:29,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:29,692 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:29,715 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 01:37:29,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:29,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:29,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:29,751 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) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:29,773 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 01:37:29,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,775 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2020-07-29 01:37:29,775 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:37:29,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,809 INFO L401 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2020-07-29 01:37:29,809 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:37:29,869 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 01:37:29,893 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 01:37:29,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:29,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:29,900 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) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:29,924 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 01:37:29,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:29,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:29,930 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) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:29,955 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 01:37:29,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:29,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:29,965 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 01:37:29,990 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 01:37:29,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:29,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:29,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 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 01:37:30,020 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 01:37:30,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,028 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) [2020-07-29 01:37:30,052 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,089 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:30,178 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2020-07-29 01:37:30,178 INFO L444 ModelExtractionUtils]: 13 out of 52 variables were initially zero. Simplification set additionally 34 variables to zero. 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 01:37:30,180 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:30,182 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:37:30,183 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:30,183 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_substring_~ps2~0.offset) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 + 1*ULTIMATE.start_main_~length1~0 >= 0] [2020-07-29 01:37:30,466 INFO L297 tatePredicateManager]: 40 out of 42 supporting invariants were superfluous and have been removed [2020-07-29 01:37:30,481 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~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset;" [2020-07-29 01:37:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:37:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:30,597 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_98|], 1=[|v_#valid_125|]} [2020-07-29 01:37:30,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:37:30,617 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2020-07-29 01:37:30,617 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:30,626 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:30,637 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 01:37:30,642 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:30,652 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:30,663 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:30,664 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:10 [2020-07-29 01:37:30,667 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:30,667 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_98|, |ULTIMATE.start_main_#t~malloc14.base|, ULTIMATE.start_main_~length2~0, |v_#valid_125|]. (and (= (store (store |v_#length_98| |ULTIMATE.start_main_#t~malloc13.base| ULTIMATE.start_main_~length1~0) |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_main_~length2~0) |#length|) (<= (select (store |v_#valid_125| |ULTIMATE.start_main_#t~malloc13.base| 1) |ULTIMATE.start_main_#t~malloc14.base|) 0) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded) [2020-07-29 01:37:30,667 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded) [2020-07-29 01:37:30,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {840#unseeded} is VALID [2020-07-29 01:37:30,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#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~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {840#unseeded} is VALID [2020-07-29 01:37:30,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#unseeded} assume !(main_~length1~0 < 1); {840#unseeded} is VALID [2020-07-29 01:37:30,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#unseeded} assume !(main_~length2~0 < 1); {840#unseeded} is VALID [2020-07-29 01:37:30,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#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;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; {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,715 INFO L280 TraceCheckUtils]: 6: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,717 INFO L280 TraceCheckUtils]: 8: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,717 INFO L280 TraceCheckUtils]: 9: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,725 INFO L280 TraceCheckUtils]: 10: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,730 INFO L280 TraceCheckUtils]: 11: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:30,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {1086#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1065#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:37:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:30,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:30,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} 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; {1117#(and (<= (+ 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|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} is VALID [2020-07-29 01:37:30,787 INFO L280 TraceCheckUtils]: 2: Hoare triple {1117#(and (<= (+ 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|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; {1068#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or unseeded (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (>= oldRank0 0))) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:30,787 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 01:37:30,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:37:30,818 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 01:37:30,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,818 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:37:30,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 01:37:30,971 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 42 states and 54 transitions. Complement of second has 8 states. [2020-07-29 01:37:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:30,971 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:30,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:30,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:30,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:30,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:37:30,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:30,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:30,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:30,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2020-07-29 01:37:30,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:30,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:30,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:30,974 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:30,975 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:30,975 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:37:30,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:30,976 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:30,976 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 54 transitions. cyclomatic complexity: 16 [2020-07-29 01:37:30,977 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:30,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:30,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:30,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:30,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:37:30,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:37:30,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:37:30,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:30,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:30,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:30,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:30,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:30,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:30,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:30,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:30,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:30,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:30,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:30,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:30,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:30,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:30,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:30,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:30,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:30,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:30,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:30,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:30,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:30,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,987 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:37:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:37:30,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:30,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:30,988 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:37:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:31,084 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_99|], 1=[|v_#valid_126|]} [2020-07-29 01:37:31,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:37:31,090 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2020-07-29 01:37:31,090 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,103 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:31,111 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 01:37:31,114 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,121 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:31,129 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,129 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:10 [2020-07-29 01:37:31,131 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:31,132 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_99|, |ULTIMATE.start_main_#t~malloc14.base|, ULTIMATE.start_main_~length2~0, |v_#valid_126|]. (and (<= (select (store |v_#valid_126| |ULTIMATE.start_main_#t~malloc13.base| 1) |ULTIMATE.start_main_#t~malloc14.base|) 0) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= |#length| (store (store |v_#length_99| |ULTIMATE.start_main_#t~malloc13.base| ULTIMATE.start_main_~length1~0) |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_main_~length2~0)) unseeded) [2020-07-29 01:37:31,132 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded) [2020-07-29 01:37:31,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {840#unseeded} is VALID [2020-07-29 01:37:31,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#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~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {840#unseeded} is VALID [2020-07-29 01:37:31,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#unseeded} assume !(main_~length1~0 < 1); {840#unseeded} is VALID [2020-07-29 01:37:31,181 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#unseeded} assume !(main_~length2~0 < 1); {840#unseeded} is VALID [2020-07-29 01:37:31,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#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;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; {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,184 INFO L280 TraceCheckUtils]: 5: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,189 INFO L280 TraceCheckUtils]: 12: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {1193#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1065#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:37:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:31,235 INFO L280 TraceCheckUtils]: 0: Hoare triple {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:31,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} 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; {1224#(and (<= (+ 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|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} is VALID [2020-07-29 01:37:31,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {1224#(and (<= (+ 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|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; {1068#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or unseeded (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (>= oldRank0 0))) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:31,238 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 01:37:31,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:37:31,266 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 01:37:31,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,266 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:37:31,267 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 01:37:31,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 42 states and 54 transitions. Complement of second has 8 states. [2020-07-29 01:37:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:31,363 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:31,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:31,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:37:31,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2020-07-29 01:37:31,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,367 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:31,367 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:31,367 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:37:31,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,368 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:31,368 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 54 transitions. cyclomatic complexity: 16 [2020-07-29 01:37:31,369 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:31,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:37:31,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:37:31,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:37:31,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:31,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:31,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:31,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:31,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:31,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:31,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,384 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:37:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:37:31,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,386 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:37:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:37:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:31,455 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_100|], 1=[|v_#valid_127|]} [2020-07-29 01:37:31,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:37:31,461 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2020-07-29 01:37:31,462 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,470 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:31,477 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 01:37:31,480 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,488 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:31,497 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,497 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:10 [2020-07-29 01:37:31,499 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:31,499 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_100|, |ULTIMATE.start_main_#t~malloc14.base|, ULTIMATE.start_main_~length2~0, |v_#valid_127|]. (and (<= (select (store |v_#valid_127| |ULTIMATE.start_main_#t~malloc13.base| 1) |ULTIMATE.start_main_#t~malloc14.base|) 0) (= (store (store |v_#length_100| |ULTIMATE.start_main_#t~malloc13.base| ULTIMATE.start_main_~length1~0) |ULTIMATE.start_main_#t~malloc14.base| ULTIMATE.start_main_~length2~0) |#length|) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded) [2020-07-29 01:37:31,499 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded) [2020-07-29 01:37:31,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {840#unseeded} is VALID [2020-07-29 01:37:31,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#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~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; {840#unseeded} is VALID [2020-07-29 01:37:31,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#unseeded} assume !(main_~length1~0 < 1); {840#unseeded} is VALID [2020-07-29 01:37:31,534 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#unseeded} assume !(main_~length2~0 < 1); {840#unseeded} is VALID [2020-07-29 01:37:31,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#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;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; {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,538 INFO L280 TraceCheckUtils]: 5: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,543 INFO L280 TraceCheckUtils]: 9: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,543 INFO L280 TraceCheckUtils]: 10: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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); {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= ULTIMATE.start_substring_~ps~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:37:31,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {1300#(and (= ULTIMATE.start_main_~length1~0 (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) (= 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; {1065#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:37:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:31,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:31,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {1066#(and (>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} 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; {1331#(and (<= (+ 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|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} is VALID [2020-07-29 01:37:31,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {1331#(and (<= (+ 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|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_substring_~ps2~0.offset)))} assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; {1068#(and (= ULTIMATE.start_substring_~ps2~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or unseeded (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_substring_~ps2~0.offset))) (>= oldRank0 0))) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|)) ULTIMATE.start_main_~length1~0) 0))} is VALID [2020-07-29 01:37:31,596 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 01:37:31,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:37:31,618 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 01:37:31,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,618 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:37:31,618 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 01:37:31,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 50 states and 66 transitions. Complement of second has 7 states. [2020-07-29 01:37:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:31,777 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:31,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:31,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:37:31,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2020-07-29 01:37:31,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,782 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 32 transitions. cyclomatic complexity: 11 [2020-07-29 01:37:31,782 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:31,782 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:37:31,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,788 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:31,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 66 transitions. cyclomatic complexity: 21 [2020-07-29 01:37:31,789 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:31,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:37:31,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:37:31,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:37:31,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:31,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:31,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:37:31,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:31,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:31,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:37:31,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:37:31,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:37:31,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:31,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:31,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:31,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:37:31,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 66 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:37:31,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,806 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:37:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-29 01:37:31,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:37:31,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:37:31,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:37:31,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:31,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. cyclomatic complexity: 21 [2020-07-29 01:37:31,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 54 transitions. [2020-07-29 01:37:31,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:37:31,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:37:31,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2020-07-29 01:37:31,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:31,826 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2020-07-29 01:37:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2020-07-29 01:37:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-07-29 01:37:31,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:31,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 54 transitions. Second operand 39 states. [2020-07-29 01:37:31,830 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 54 transitions. Second operand 39 states. [2020-07-29 01:37:31,830 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand 39 states. [2020-07-29 01:37:31,830 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:31,834 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2020-07-29 01:37:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2020-07-29 01:37:31,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:31,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:31,835 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states and 54 transitions. [2020-07-29 01:37:31,835 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states and 54 transitions. [2020-07-29 01:37:31,836 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:31,838 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2020-07-29 01:37:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-07-29 01:37:31,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:31,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:31,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:31,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:37:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2020-07-29 01:37:31,843 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2020-07-29 01:37:31,844 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2020-07-29 01:37:31,844 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:37:31,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 52 transitions. [2020-07-29 01:37:31,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:31,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:31,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:31,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:31,845 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:31,846 INFO L794 eck$LassoCheckResult]: Stem: 1410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1401#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1402#L565 assume !(main_~length1~0 < 1); 1411#L565-2 assume !(main_~length2~0 < 1); 1412#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1405#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1406#L550-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; 1431#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1421#L553-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; 1420#L553-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6; 1403#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1404#L557 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; 1407#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1409#L550-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; 1418#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1398#L553-1 [2020-07-29 01:37:31,846 INFO L796 eck$LassoCheckResult]: Loop: 1398#L553-1 assume !substring_#t~short6; 1413#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1397#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1398#L553-1 [2020-07-29 01:37:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:31,846 INFO L82 PathProgramCache]: Analyzing trace with hash 468269947, now seen corresponding path program 3 times [2020-07-29 01:37:31,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:31,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049239780] [2020-07-29 01:37:31,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:31,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:31,883 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2020-07-29 01:37:31,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:31,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065359914] [2020-07-29 01:37:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {1593#true} assume !substring_#t~short6; {1595#(not |ULTIMATE.start_substring_#t~short6|)} is VALID [2020-07-29 01:37:31,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {1595#(not |ULTIMATE.start_substring_#t~short6|)} assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; {1594#false} is VALID [2020-07-29 01:37:31,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {1594#false} call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; {1594#false} is VALID [2020-07-29 01:37:31,895 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 01:37:31,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065359914] [2020-07-29 01:37:31,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:31,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:37:31,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509591983] [2020-07-29 01:37:31,896 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:37:31,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:37:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:37:31,897 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-07-29 01:37:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:31,941 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-07-29 01:37:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:37:31,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:37:31,947 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 01:37:31,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2020-07-29 01:37:31,949 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:31,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2020-07-29 01:37:31,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:37:31,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:37:31,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:37:31,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:31,950 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:31,950 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:31,950 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:37:31,950 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:37:31,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:37:31,950 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:37:31,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:37:31,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:37:31 BoogieIcfgContainer [2020-07-29 01:37:31,959 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:37:31,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:37:31,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:37:31,960 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:37:31,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:15" (3/4) ... [2020-07-29 01:37:31,965 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:37:31,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:37:31,967 INFO L168 Benchmark]: Toolchain (without parser) took 18097.21 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 484.4 MB). Free memory was 961.6 MB in the beginning and 1.4 GB in the end (delta: -470.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:31,967 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:31,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:31,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.62 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:31,969 INFO L168 Benchmark]: Boogie Preprocessor took 35.75 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 01:37:31,969 INFO L168 Benchmark]: RCFGBuilder took 516.33 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.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:31,970 INFO L168 Benchmark]: BuchiAutomizer took 16830.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -346.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:31,970 INFO L168 Benchmark]: Witness Printer took 5.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:31,972 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.62 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.75 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 516.33 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.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16830.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -346.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -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 4 locations. One nondeterministic module has affine ranking function length1 + -1 * ps2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 14.1s. Construction of modules took 0.2s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 97 SDslu, 58 SDs, 0 SdLazy, 107 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital247 mio100 ax107 hnf99 lsp90 ukn84 mio100 lsp39 div100 bol100 ite100 ukn100 eq192 hnf88 smp95 dnf196 smp75 tf100 neg92 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 98ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...