./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca.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-15/cstrpbrk_reverse_alloca.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 2f11210fb32f4d3c697b29c6d0c40652627e6e63 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:39:50,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:50,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:50,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:50,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:50,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:50,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:50,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:50,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:50,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:50,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:50,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:50,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:50,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:50,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:50,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:50,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:50,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:50,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:50,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:50,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:50,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:50,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:50,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:50,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:50,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:50,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:50,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:50,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:50,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:50,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:50,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:50,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:50,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:50,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:50,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:50,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:50,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:50,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:50,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:50,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:50,688 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:39:50,724 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:50,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:50,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:50,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:50,726 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:50,726 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:50,727 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:50,727 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:50,727 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:50,727 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:50,727 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:50,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:50,728 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:50,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:50,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:50,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:50,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:50,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:50,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:50,729 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:50,730 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:50,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:50,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:50,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:50,730 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:50,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:50,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:50,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:50,731 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:50,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:50,733 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 -> 2f11210fb32f4d3c697b29c6d0c40652627e6e63 [2020-07-29 01:39:51,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:51,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:51,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:51,096 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:51,097 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:51,098 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca.i [2020-07-29 01:39:51,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/151201c57/0f6c9835d3d64c0f84a2ac29bbf90bc0/FLAGdf7eae75e [2020-07-29 01:39:51,780 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:51,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca.i [2020-07-29 01:39:51,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/151201c57/0f6c9835d3d64c0f84a2ac29bbf90bc0/FLAGdf7eae75e [2020-07-29 01:39:52,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/151201c57/0f6c9835d3d64c0f84a2ac29bbf90bc0 [2020-07-29 01:39:52,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:52,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:52,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:52,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:52,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:52,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1569f8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52, skipping insertion in model container [2020-07-29 01:39:52,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:52,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:52,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:52,720 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:52,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:52,852 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:52,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52 WrapperNode [2020-07-29 01:39:52,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:52,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:52,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:52,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:52,863 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:39:52" (1/1) ... [2020-07-29 01:39:52,879 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:39:52" (1/1) ... [2020-07-29 01:39:52,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:52,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:52,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:52,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:52,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (1/1) ... [2020-07-29 01:39:52,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:52,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:52,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:52,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:52,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (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:39:53,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:53,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:53,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:53,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:53,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:53,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:53,478 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:53,478 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:53,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:53 BoogieIcfgContainer [2020-07-29 01:39:53,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:53,483 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:53,483 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:53,487 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:53,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:53,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:52" (1/3) ... [2020-07-29 01:39:53,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6668abfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:53, skipping insertion in model container [2020-07-29 01:39:53,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:53,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:52" (2/3) ... [2020-07-29 01:39:53,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6668abfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:53, skipping insertion in model container [2020-07-29 01:39:53,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:53,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:53" (3/3) ... [2020-07-29 01:39:53,493 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_reverse_alloca.i [2020-07-29 01:39:53,546 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:53,546 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:53,547 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:53,547 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:53,547 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:53,547 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:53,548 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:53,548 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:53,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:53,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:53,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:53,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:53,600 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:53,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:53,601 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:53,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:53,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:53,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:53,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:53,606 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:53,606 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:53,616 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2020-07-29 01:39:53,617 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2020-07-29 01:39:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:53,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:53,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420218983] [2020-07-29 01:39:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-07-29 01:39:53,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:53,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647120157] [2020-07-29 01:39:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:53,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {24#true} is VALID [2020-07-29 01:39:53,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {24#true} is VALID [2020-07-29 01:39:53,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-29 01:39:53,896 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {25#false} is VALID [2020-07-29 01:39:53,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {25#false} is VALID [2020-07-29 01:39:53,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {25#false} is VALID [2020-07-29 01:39:53,900 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:39:53,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647120157] [2020-07-29 01:39:53,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:53,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:53,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642138497] [2020-07-29 01:39:53,908 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:53,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:39:53,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:39:53,927 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-29 01:39:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:53,968 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:53,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:39:53,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:39:53,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:53,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:39:53,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:53,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-07-29 01:39:53,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:39:53,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:39:53,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:39:54,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:54,000 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:39:54,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:39:54,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:54,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:54,032 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:54,034 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:54,036 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:54,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:54,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:54,039 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:54,039 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:54,041 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:54,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:54,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:54,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:54,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:39:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:39:54,046 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:54,047 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:54,047 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:54,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:54,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:54,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:54,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:54,049 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:54,049 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:54,050 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2020-07-29 01:39:54,050 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2020-07-29 01:39:54,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:39:54,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:54,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822983278] [2020-07-29 01:39:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,081 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-07-29 01:39:54,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:54,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013249207] [2020-07-29 01:39:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-07-29 01:39:54,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:54,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51433802] [2020-07-29 01:39:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,335 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:54,575 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-29 01:39:55,066 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2020-07-29 01:39:55,230 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-29 01:39:55,245 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:55,246 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:55,246 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:55,246 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:55,246 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:55,247 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:55,247 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:55,247 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:55,247 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca.i_Iteration2_Lasso [2020-07-29 01:39:55,247 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:55,248 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:55,317 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:39:55,329 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:39:55,333 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:39:55,337 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:39:55,343 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:39:55,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,352 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:39:55,800 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2020-07-29 01:39:56,049 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-07-29 01:39:56,058 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:39:56,063 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:39:56,068 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:39:56,101 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:39:56,108 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:39:56,115 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:39:56,122 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:39:56,127 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:39:56,131 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:39:56,137 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:39:56,141 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:39:56,145 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:39:56,150 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:39:57,146 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-07-29 01:39:57,335 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:57,340 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,345 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:39:57,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,382 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:39:57,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,388 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:39:57,413 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:39:57,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,443 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:39:57,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:57,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:57,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,482 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:39:57,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,486 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,516 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:39:57,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,521 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:39:57,548 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:39:57,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:57,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:57,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:57,647 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:39:57,648 INFO L444 ModelExtractionUtils]: 20 out of 49 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,700 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:57,741 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:57,741 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:57,742 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 2*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1 Supporting invariants [] [2020-07-29 01:39:57,879 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:39:57,885 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);" "assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207;" "call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208;" "assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;" "call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);" "assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212;" "cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset;" [2020-07-29 01:39:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:57,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2020-07-29 01:39:57,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {92#unseeded} is VALID [2020-07-29 01:39:57,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:57,987 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:57,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {92#unseeded} is VALID [2020-07-29 01:39:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:58,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:58,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:58,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1))} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:39:58,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:39:58,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:39:58,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:39:58,040 INFO L280 TraceCheckUtils]: 4: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:39:58,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:39:58,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:39:58,043 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset))} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {150#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~sc1~0.offset) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:58,044 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:39:58,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:58,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:58,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,064 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:39:58,065 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:39:58,137 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2020-07-29 01:39:58,137 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:39:58,137 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:58,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:58,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:58,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:58,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:58,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:58,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:58,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:58,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:39:58,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:58,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:58,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:58,147 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:58,150 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:39:58,150 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:58,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:58,153 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:58,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:58,154 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:58,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:58,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:58,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:58,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:58,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:58,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:58,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:58,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:58,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:58,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:58,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:58,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:58,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:58,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:58,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:58,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:58,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:58,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:58,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:58,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:58,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:58,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:58,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:58,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:58,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:58,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:58,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:58,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:58,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,186 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 01:39:58,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:58,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:39:58,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-29 01:39:58,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:58,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:58,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-07-29 01:39:58,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:39:58,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:58,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:39:58,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:58,195 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:39:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:39:58,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:58,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:58,198 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:58,198 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:58,199 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:58,202 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:58,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:58,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:58,203 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:58,203 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:58,204 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:58,206 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:58,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:58,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:58,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:58,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:39:58,210 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:58,210 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:58,210 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:58,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:58,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:58,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:58,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:58,212 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:58,212 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:58,212 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 224#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 225#L382 assume !(main_~length1~0 < 1); 226#L382-2 assume !(main_~length2~0 < 1); 223#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 220#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 222#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 232#L372-5 [2020-07-29 01:39:58,213 INFO L796 eck$LassoCheckResult]: Loop: 232#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 227#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 228#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 232#L372-5 [2020-07-29 01:39:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-07-29 01:39:58,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:58,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903122183] [2020-07-29 01:39:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-07-29 01:39:58,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:58,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307560144] [2020-07-29 01:39:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:58,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-07-29 01:39:58,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:58,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702438536] [2020-07-29 01:39:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:58,484 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-29 01:39:59,005 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2020-07-29 01:39:59,192 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-07-29 01:39:59,195 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:59,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:59,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:59,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:59,196 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:59,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:59,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:59,197 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:59,197 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca.i_Iteration3_Lasso [2020-07-29 01:39:59,197 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:59,198 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:59,231 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:39:59,235 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:39:59,239 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:39:59,244 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:39:59,248 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:39:59,251 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:39:59,637 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2020-07-29 01:39:59,772 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-07-29 01:39:59,779 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:39:59,783 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:39:59,787 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:39:59,791 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:39:59,795 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:39:59,805 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:39:59,809 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:39:59,814 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:39:59,818 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:39:59,821 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:39:59,826 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:39:59,829 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:39:59,832 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:39:59,836 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:40:00,796 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:40:01,080 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:01,083 INFO L489 LassoAnalysis]: Using template 'affine'. 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:40:01,087 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:40:01,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,117 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:40:01,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,121 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:40:01,145 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:40:01,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,157 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) [2020-07-29 01:40:01,218 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:40:01,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,228 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:40:01,285 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:40:01,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,290 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:40:01,327 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:40:01,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,336 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:40:01,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,401 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:40:01,426 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:40:01,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,437 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:40:01,464 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:40:01,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,467 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:40:01,467 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 01:40:01,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,545 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2020-07-29 01:40:01,546 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 01:40:01,678 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:40:01,704 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:40:01,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,746 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:01,783 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:40:01,783 INFO L444 ModelExtractionUtils]: 16 out of 49 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:01,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,799 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:01,799 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:01,799 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1 Supporting invariants [] [2020-07-29 01:40:01,899 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2020-07-29 01:40:01,903 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208;" "assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset;" [2020-07-29 01:40:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:40:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:01,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {323#unseeded} is VALID [2020-07-29 01:40:01,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {323#unseeded} is VALID [2020-07-29 01:40:01,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~length1~0 < 1); {323#unseeded} is VALID [2020-07-29 01:40:01,965 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~length2~0 < 1); {323#unseeded} is VALID [2020-07-29 01:40:01,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {323#unseeded} is VALID [2020-07-29 01:40:01,967 INFO L280 TraceCheckUtils]: 5: Hoare triple {323#unseeded} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {323#unseeded} is VALID [2020-07-29 01:40:01,968 INFO L280 TraceCheckUtils]: 6: Hoare triple {323#unseeded} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {323#unseeded} is VALID [2020-07-29 01:40:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:40:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:02,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {429#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:02,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {429#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {429#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:02,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {429#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {406#(or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1)) (>= oldRank0 0)))} is VALID [2020-07-29 01:40:02,012 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:40:02,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:40:02,025 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:40:02,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,026 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:40:02,026 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:40:02,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2020-07-29 01:40:02,100 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:40:02,101 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:02,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:40:02,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:40:02,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:02,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-07-29 01:40:02,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,112 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:40:02,113 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:02,113 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:40:02,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:02,114 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:02,114 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:02,117 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:02,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:02,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:02,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:02,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:40:02,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:40:02,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:40:02,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:40:02,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:40:02,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:40:02,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:02,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:02,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:02,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:02,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:02,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:02,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:02,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:02,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:02,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:02,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:02,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:02,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:02,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:02,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:02,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:02,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:02,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:02,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,130 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:40:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:40:02,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:02,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:40:02,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:02,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-07-29 01:40:02,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:40:02,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:40:02,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:02,137 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:40:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-29 01:40:02,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:02,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:02,140 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:02,140 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:02,141 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,143 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:40:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,146 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:40:02,146 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:40:02,147 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,149 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:40:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:02,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:40:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 01:40:02,152 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:40:02,152 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:40:02,152 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:40:02,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:40:02,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:02,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:02,154 INFO L794 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 495#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 496#L382 assume !(main_~length1~0 < 1); 497#L382-2 assume !(main_~length2~0 < 1); 494#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 490#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 491#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 504#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 500#L372-1 assume !cstrpbrk_#t~short210; 501#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 486#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 487#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 488#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 489#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 493#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 503#L372-5 [2020-07-29 01:40:02,154 INFO L796 eck$LassoCheckResult]: Loop: 503#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 498#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 499#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 503#L372-5 [2020-07-29 01:40:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-07-29 01:40:02,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018184325] [2020-07-29 01:40:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:02,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {634#true} is VALID [2020-07-29 01:40:02,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {634#true} is VALID [2020-07-29 01:40:02,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume !(main_~length1~0 < 1); {634#true} is VALID [2020-07-29 01:40:02,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {634#true} assume !(main_~length2~0 < 1); {634#true} is VALID [2020-07-29 01:40:02,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {634#true} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {634#true} is VALID [2020-07-29 01:40:02,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {634#true} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {636#(= |ULTIMATE.start_cstrpbrk_#t~mem206| (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:40:02,257 INFO L280 TraceCheckUtils]: 6: Hoare triple {636#(= |ULTIMATE.start_cstrpbrk_#t~mem206| (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset))} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {637#(not (= 0 ULTIMATE.start_cstrpbrk_~c~0))} is VALID [2020-07-29 01:40:02,262 INFO L280 TraceCheckUtils]: 7: Hoare triple {637#(not (= 0 ULTIMATE.start_cstrpbrk_~c~0))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {638#(or (not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset))) |ULTIMATE.start_cstrpbrk_#t~short210|)} is VALID [2020-07-29 01:40:02,263 INFO L280 TraceCheckUtils]: 8: Hoare triple {638#(or (not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset))) |ULTIMATE.start_cstrpbrk_#t~short210|)} assume !cstrpbrk_#t~short210; {639#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} is VALID [2020-07-29 01:40:02,264 INFO L280 TraceCheckUtils]: 9: Hoare triple {639#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; {639#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} is VALID [2020-07-29 01:40:02,267 INFO L280 TraceCheckUtils]: 10: Hoare triple {639#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {640#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212| ULTIMATE.start_cstrpbrk_~c~0))} is VALID [2020-07-29 01:40:02,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {640#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212| ULTIMATE.start_cstrpbrk_~c~0))} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {635#false} is VALID [2020-07-29 01:40:02,268 INFO L280 TraceCheckUtils]: 12: Hoare triple {635#false} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {635#false} is VALID [2020-07-29 01:40:02,268 INFO L280 TraceCheckUtils]: 13: Hoare triple {635#false} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {635#false} is VALID [2020-07-29 01:40:02,269 INFO L280 TraceCheckUtils]: 14: Hoare triple {635#false} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {635#false} is VALID [2020-07-29 01:40:02,270 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:40:02,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018184325] [2020-07-29 01:40:02,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:40:02,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:40:02,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123886590] [2020-07-29 01:40:02,271 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:40:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-07-29 01:40:02,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227906149] [2020-07-29 01:40:02,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:02,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:40:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:40:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:40:02,416 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:40:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:02,646 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-29 01:40:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:40:02,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:40:02,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:02,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-07-29 01:40:02,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:40:02,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2020-07-29 01:40:02,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:40:02,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:40:02,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:02,684 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-29 01:40:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-29 01:40:02,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:02,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:02,687 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:02,687 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:02,687 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,689 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:40:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,690 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:40:02,690 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:40:02,691 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,693 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:40:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:02,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:40:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-29 01:40:02,695 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:40:02,695 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:40:02,695 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:40:02,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-07-29 01:40:02,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,696 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:02,696 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:02,697 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 690#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 691#L382 assume !(main_~length1~0 < 1); 692#L382-2 assume !(main_~length2~0 < 1); 689#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 685#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 686#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 699#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 703#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 702#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 681#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 682#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 683#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 684#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 688#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 698#L372-5 [2020-07-29 01:40:02,697 INFO L796 eck$LassoCheckResult]: Loop: 698#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 694#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 695#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 698#L372-5 [2020-07-29 01:40:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-07-29 01:40:02,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536287277] [2020-07-29 01:40:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-07-29 01:40:02,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130786313] [2020-07-29 01:40:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-07-29 01:40:02,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874588265] [2020-07-29 01:40:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:03,782 WARN L193 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 143 [2020-07-29 01:40:04,087 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-07-29 01:40:04,091 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:04,091 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:04,091 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:04,091 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:04,092 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:04,092 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:04,092 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:04,092 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:04,092 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_reverse_alloca.i_Iteration5_Lasso [2020-07-29 01:40:04,092 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:04,093 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:04,136 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:40:04,140 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:40:04,144 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:40:04,148 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:40:04,152 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:40:04,155 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:40:04,161 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:40:05,434 WARN L193 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2020-07-29 01:40:05,617 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-07-29 01:40:05,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:40:05,631 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:40:05,635 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:40:05,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:40:05,641 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:40:05,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:40:05,651 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:40:05,654 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:40:05,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:40:05,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:05,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:05,667 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:40:05,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:40:05,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:40:06,144 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-07-29 01:40:06,452 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-07-29 01:40:06,983 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-07-29 01:40:07,203 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:40:07,574 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:07,575 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,583 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:40:07,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,595 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) [2020-07-29 01:40:07,658 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:40:07,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,663 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,686 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:40:07,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,689 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:40:07,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:07,737 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:40:07,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,740 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) [2020-07-29 01:40:07,762 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:40:07,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,769 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:40:07,792 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:40:07,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,799 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:40:07,822 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:40:07,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,824 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:40:07,824 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 01:40:07,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,899 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2020-07-29 01:40:07,900 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 01:40:08,248 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) [2020-07-29 01:40:08,300 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:40:08,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,312 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) [2020-07-29 01:40:08,384 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:40:08,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,392 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) [2020-07-29 01:40:08,453 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:40:08,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,473 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:40:08,542 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:40:08,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,557 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:40:08,586 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) [2020-07-29 01:40:08,655 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:40:08,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,664 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) [2020-07-29 01:40:08,734 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:40:08,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,786 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:08,846 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-07-29 01:40:08,846 INFO L444 ModelExtractionUtils]: 22 out of 52 variables were initially zero. Simplification set additionally 27 variables to zero. 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) [2020-07-29 01:40:08,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,853 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:08,854 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:08,854 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1 Supporting invariants [] [2020-07-29 01:40:09,049 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2020-07-29 01:40:09,052 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208;" "assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset;" [2020-07-29 01:40:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {829#unseeded} is VALID [2020-07-29 01:40:09,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {829#unseeded} is VALID [2020-07-29 01:40:09,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#unseeded} assume !(main_~length1~0 < 1); {829#unseeded} is VALID [2020-07-29 01:40:09,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {829#unseeded} assume !(main_~length2~0 < 1); {829#unseeded} is VALID [2020-07-29 01:40:09,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {829#unseeded} is VALID [2020-07-29 01:40:09,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#unseeded} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#unseeded} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {829#unseeded} is VALID [2020-07-29 01:40:09,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#unseeded} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {829#unseeded} is VALID [2020-07-29 01:40:09,133 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#unseeded} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {829#unseeded} is VALID [2020-07-29 01:40:09,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#unseeded} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; {829#unseeded} is VALID [2020-07-29 01:40:09,134 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#unseeded} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#unseeded} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {829#unseeded} is VALID [2020-07-29 01:40:09,135 INFO L280 TraceCheckUtils]: 12: Hoare triple {829#unseeded} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {829#unseeded} is VALID [2020-07-29 01:40:09,136 INFO L280 TraceCheckUtils]: 13: Hoare triple {829#unseeded} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,136 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#unseeded} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {829#unseeded} is VALID [2020-07-29 01:40:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {832#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1039#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:09,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {1039#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1039#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:09,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {1039#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {992#(or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1)) (>= oldRank0 0)))} is VALID [2020-07-29 01:40:09,180 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:40:09,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:40:09,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:09,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,191 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:40:09,191 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:40:09,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2020-07-29 01:40:09,262 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:40:09,262 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:40:09,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:40:09,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:09,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,265 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,266 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:09,266 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:40:09,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,267 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:09,267 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:09,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:09,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,278 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:40:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:40:09,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,279 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {829#unseeded} is VALID [2020-07-29 01:40:09,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {829#unseeded} is VALID [2020-07-29 01:40:09,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#unseeded} assume !(main_~length1~0 < 1); {829#unseeded} is VALID [2020-07-29 01:40:09,351 INFO L280 TraceCheckUtils]: 3: Hoare triple {829#unseeded} assume !(main_~length2~0 < 1); {829#unseeded} is VALID [2020-07-29 01:40:09,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {829#unseeded} is VALID [2020-07-29 01:40:09,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#unseeded} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#unseeded} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {829#unseeded} is VALID [2020-07-29 01:40:09,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#unseeded} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {829#unseeded} is VALID [2020-07-29 01:40:09,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#unseeded} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {829#unseeded} is VALID [2020-07-29 01:40:09,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#unseeded} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; {829#unseeded} is VALID [2020-07-29 01:40:09,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#unseeded} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#unseeded} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {829#unseeded} is VALID [2020-07-29 01:40:09,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {829#unseeded} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {829#unseeded} is VALID [2020-07-29 01:40:09,357 INFO L280 TraceCheckUtils]: 13: Hoare triple {829#unseeded} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,357 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#unseeded} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {829#unseeded} is VALID [2020-07-29 01:40:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {832#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1140#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:09,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1140#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:09,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {992#(or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1)) (>= oldRank0 0)))} is VALID [2020-07-29 01:40:09,389 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:40:09,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:40:09,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:09,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:40:09,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:40:09,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2020-07-29 01:40:09,448 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:40:09,448 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:40:09,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:40:09,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:09,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,452 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,452 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:09,452 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:40:09,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,453 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:09,453 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:09,454 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:09,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,463 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:40:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:40:09,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,464 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {829#unseeded} is VALID [2020-07-29 01:40:09,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {829#unseeded} is VALID [2020-07-29 01:40:09,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#unseeded} assume !(main_~length1~0 < 1); {829#unseeded} is VALID [2020-07-29 01:40:09,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {829#unseeded} assume !(main_~length2~0 < 1); {829#unseeded} is VALID [2020-07-29 01:40:09,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {829#unseeded} is VALID [2020-07-29 01:40:09,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#unseeded} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#unseeded} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {829#unseeded} is VALID [2020-07-29 01:40:09,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#unseeded} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {829#unseeded} is VALID [2020-07-29 01:40:09,519 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#unseeded} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {829#unseeded} is VALID [2020-07-29 01:40:09,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#unseeded} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; {829#unseeded} is VALID [2020-07-29 01:40:09,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#unseeded} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#unseeded} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {829#unseeded} is VALID [2020-07-29 01:40:09,520 INFO L280 TraceCheckUtils]: 12: Hoare triple {829#unseeded} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset - 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {829#unseeded} is VALID [2020-07-29 01:40:09,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {829#unseeded} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {829#unseeded} is VALID [2020-07-29 01:40:09,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#unseeded} assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {829#unseeded} is VALID [2020-07-29 01:40:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {832#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1241#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:09,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {1241#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1241#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} is VALID [2020-07-29 01:40:09,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {1241#(and (<= (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1) oldRank0) (<= 0 ULTIMATE.start_cstrpbrk_~s~0.offset))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {992#(or unseeded (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrpbrk_~s~0.offset) 1)) (>= oldRank0 0)))} is VALID [2020-07-29 01:40:09,550 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:40:09,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:40:09,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:09,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,561 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:40:09,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:40:09,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2020-07-29 01:40:09,629 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:40:09,629 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:40:09,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2020-07-29 01:40:09,631 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,631 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,631 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:09,631 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:40:09,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,632 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:09,633 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:40:09,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:40:09,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:40:09,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,640 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:40:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2020-07-29 01:40:09,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:09,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:40:09,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,644 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-07-29 01:40:09,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:40:09,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:40:09,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:40:09,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:40:09,645 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,645 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,645 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,645 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:40:09,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:40:09,645 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:40:09 BoogieIcfgContainer [2020-07-29 01:40:09,652 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:40:09,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:40:09,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:40:09,653 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:40:09,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:53" (3/4) ... [2020-07-29 01:40:09,657 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:40:09,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:40:09,660 INFO L168 Benchmark]: Toolchain (without parser) took 17641.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.3 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -112.7 MB). Peak memory consumption was 281.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,660 INFO L168 Benchmark]: CDTParser took 0.43 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:40:09,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 831.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.58 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:40:09,662 INFO L168 Benchmark]: Boogie Preprocessor took 32.07 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:40:09,663 INFO L168 Benchmark]: RCFGBuilder took 538.49 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.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,663 INFO L168 Benchmark]: BuchiAutomizer took 16169.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,664 INFO L168 Benchmark]: Witness Printer took 5.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:09,667 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 0.43 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 831.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.58 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 32.07 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 538.49 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.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16169.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 120 SDtfs, 138 SDslu, 58 SDs, 0 SdLazy, 76 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital284 mio100 ax100 hnf99 lsp106 ukn86 mio100 lsp42 div114 bol100 ite100 ukn100 eq181 hnf76 smp94 dnf539 smp30 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 428ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...