./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_malloc.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_malloc.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 490e2fc9530e2aed3bf6518ae9d012c90796da95 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:49,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:49,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:49,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:49,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:49,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:49,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:49,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:49,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:49,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:49,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:49,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:49,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:49,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:49,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:49,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:49,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:49,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:49,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:49,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:49,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:49,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:49,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:49,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:49,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:49,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:49,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:49,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:49,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:49,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:49,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:49,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:49,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:49,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:49,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:49,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:49,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:49,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:49,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:49,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:49,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:49,730 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:49,748 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:49,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:49,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:49,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:49,750 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:49,751 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:49,751 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:49,751 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:49,751 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:49,751 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:49,752 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:49,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:49,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:49,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:49,754 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:49,754 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:49,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:49,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:49,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:49,755 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:49,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:49,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:49,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:49,756 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:49,757 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:49,757 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 -> 490e2fc9530e2aed3bf6518ae9d012c90796da95 [2020-07-29 01:39:50,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:50,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:50,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:50,092 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:50,092 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:50,093 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2020-07-29 01:39:50,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f727767f/bdaf6e7156c84107b6891948f6bad5be/FLAG9204b983b [2020-07-29 01:39:50,716 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:50,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2020-07-29 01:39:50,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f727767f/bdaf6e7156c84107b6891948f6bad5be/FLAG9204b983b [2020-07-29 01:39:50,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f727767f/bdaf6e7156c84107b6891948f6bad5be [2020-07-29 01:39:50,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:50,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:50,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:50,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:50,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:50,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:50" (1/1) ... [2020-07-29 01:39:50,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a40e770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:50, skipping insertion in model container [2020-07-29 01:39:50,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:50" (1/1) ... [2020-07-29 01:39:50,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:51,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:51,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:51,403 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:51,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:51,608 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:51,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51 WrapperNode [2020-07-29 01:39:51,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:51,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:51,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:51,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:51,622 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:51" (1/1) ... [2020-07-29 01:39:51,644 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:51" (1/1) ... [2020-07-29 01:39:51,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:51,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:51,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:51,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:51,683 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:51" (1/1) ... [2020-07-29 01:39:51,683 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:51" (1/1) ... [2020-07-29 01:39:51,686 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:51" (1/1) ... [2020-07-29 01:39:51,686 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:51" (1/1) ... [2020-07-29 01:39:51,695 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:51" (1/1) ... [2020-07-29 01:39:51,700 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:51" (1/1) ... [2020-07-29 01:39:51,702 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:51" (1/1) ... [2020-07-29 01:39:51,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:51,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:51,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:51,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:51,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (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:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:39:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:51,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:52,281 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:52,281 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:52,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:52 BoogieIcfgContainer [2020-07-29 01:39:52,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:52,286 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:52,286 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:52,291 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:52,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:52,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:50" (1/3) ... [2020-07-29 01:39:52,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b2ab948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:52, skipping insertion in model container [2020-07-29 01:39:52,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:52,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (2/3) ... [2020-07-29 01:39:52,295 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b2ab948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:52, skipping insertion in model container [2020-07-29 01:39:52,295 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:52,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:52" (3/3) ... [2020-07-29 01:39:52,297 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_malloc.i [2020-07-29 01:39:52,351 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:52,351 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:52,351 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:52,352 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:52,352 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:52,352 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:52,353 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:52,353 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:52,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:52,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:52,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:52,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:52,399 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:52,399 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:52,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:52,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:52,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:52,404 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:52,404 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:52,413 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.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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:52,414 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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2020-07-29 01:39:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:52,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770417391] [2020-07-29 01:39:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:52,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-07-29 01:39:52,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077234842] [2020-07-29 01:39:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:52,669 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:52,670 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:52,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-29 01:39:52,672 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:52,672 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:52,672 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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {25#false} is VALID [2020-07-29 01:39:52,675 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:52,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077234842] [2020-07-29 01:39:52,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:52,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:52,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320236845] [2020-07-29 01:39:52,685 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:52,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:52,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:39:52,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:39:52,709 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-29 01:39:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:52,745 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:39:52,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:39:52,763 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:52,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:39:52,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-07-29 01:39:52,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:39:52,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:39:52,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:52,777 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:39:52,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:52,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:52,808 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:52,810 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:52,812 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:52,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:52,814 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:52,814 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:52,816 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:52,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:52,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:52,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:39:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:39:52,820 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:52,821 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:52,821 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:52,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:52,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:52,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:52,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:52,823 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.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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:52,823 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~mem208;havoc cstrpbrk_#t~mem209; 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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2020-07-29 01:39:52,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:39:52,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929483665] [2020-07-29 01:39:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,843 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-07-29 01:39:52,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796458014] [2020-07-29 01:39:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-07-29 01:39:52,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387536452] [2020-07-29 01:39:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,052 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:53,315 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-29 01:39:53,503 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-07-29 01:39:53,880 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2020-07-29 01:39:54,090 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-07-29 01:39:54,113 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:54,115 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:54,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:54,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:54,116 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:54,116 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:54,117 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:54,117 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:54,117 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration2_Lasso [2020-07-29 01:39:54,117 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:54,118 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:54,201 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:54,211 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:54,218 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:54,223 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:54,230 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:54,234 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:54,241 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:54,247 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:54,252 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:54,258 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:54,263 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:54,670 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2020-07-29 01:39:54,876 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-07-29 01:39:54,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,895 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:54,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,952 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:54,958 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:54,963 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:54,967 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:54,971 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,786 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-07-29 01:39:56,318 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-07-29 01:39:56,493 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:56,498 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:56,515 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:56,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:56,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:56,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:56,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,581 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:56,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:56,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:56,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,640 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:56,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:56,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:56,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,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 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:56,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:56,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:56,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:56,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:56,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,825 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:56,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:56,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:56,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,875 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:56,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:56,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,939 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:56,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:56,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:56,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:56,999 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,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,006 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) [2020-07-29 01:39:57,047 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,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,053 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:39:57,095 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,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:57,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:57,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,130 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,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,137 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) [2020-07-29 01:39:57,159 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,162 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:39:57,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,165 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:39:57,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,171 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:39:57,195 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,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:57,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:57,228 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:57,304 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:39:57,305 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. 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:39:57,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,331 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:57,332 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:57,332 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 Supporting invariants [] [2020-07-29 01:39:57,430 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:39:57,439 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~mem208;havoc cstrpbrk_#t~mem209;" "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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset;" [2020-07-29 01:39:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:57,544 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,545 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,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:57,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:57,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:39:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:57,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:57,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~sc1~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)))} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:57,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} 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 (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:57,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:57,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} 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 (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:57,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:57,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:57,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:57,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} 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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {150#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~sc1~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:57,688 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:57,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:57,725 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:57,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,731 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:57,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:39:57,868 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:57,868 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:57,868 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:57,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:57,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:57,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:57,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:39:57,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:57,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,879 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:57,882 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:39:57,882 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:57,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:57,885 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:57,886 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:57,886 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:57,887 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:57,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,887 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:57,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,888 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:57,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,889 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:57,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,889 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:57,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,890 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:57,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,890 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:57,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:57,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,891 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:57,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,891 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:57,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:57,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,892 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:57,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,892 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:57,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:57,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,893 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:57,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,893 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:57,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:57,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,894 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:57,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,894 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:57,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,895 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:57,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,895 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:57,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,896 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:57,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,896 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:57,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,897 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:57,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,897 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:57,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:57,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,898 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:57,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,899 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:57,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:57,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,900 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:57,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,900 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:57,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:57,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,901 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:57,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,902 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:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,902 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:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,903 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:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,904 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:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,904 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:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,905 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:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,905 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:57,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,906 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:57,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,906 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:57,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,907 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:57,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,907 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 01:39:57,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:39:57,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-29 01:39:57,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:57,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:57,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-07-29 01:39:57,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:39:57,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:57,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:57,915 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:39:57,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:57,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:57,917 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:57,917 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:57,918 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:57,923 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:57,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:57,924 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:57,924 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:57,924 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:57,927 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:57,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:57,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:57,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:39:57,929 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:57,929 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:57,929 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:57,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:57,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,931 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:57,931 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:57,931 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.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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:57,931 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~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 232#L372-5 [2020-07-29 01:39:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-07-29 01:39:57,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:57,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332755542] [2020-07-29 01:39:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-07-29 01:39:57,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:57,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132991040] [2020-07-29 01:39:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,992 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-07-29 01:39:57,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:57,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232100880] [2020-07-29 01:39:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:58,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:58,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:58,563 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2020-07-29 01:39:58,744 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-07-29 01:39:58,746 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:58,747 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:58,747 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:58,747 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:58,747 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:58,747 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:58,747 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:58,747 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:58,747 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration3_Lasso [2020-07-29 01:39:58,747 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:58,747 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:58,780 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:58,784 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:58,788 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:58,792 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:58,796 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:58,800 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:58,804 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:58,808 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:58,813 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:58,817 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:58,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:58,825 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:58,828 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:58,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:58,835 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:58,839 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,218 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2020-07-29 01:39:59,346 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-07-29 01:39:59,353 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,356 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,359 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,364 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,160 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-07-29 01:40:00,726 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-07-29 01:40:00,990 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:40:01,121 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:01,121 INFO L489 LassoAnalysis]: Using template 'affine'. 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,129 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,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,142 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,179 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,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,183 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,216 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,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,253 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,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,281 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,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:01,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:01,339 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,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,347 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:01,371 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,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,378 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:01,405 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,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,409 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:01,433 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,436 INFO L402 nArgumentSynthesizer]: A total of 0 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 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:01,461 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,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,465 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:01,490 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,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,519 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,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,545 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,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,573 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,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:01,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:01,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:01,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,600 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,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:01,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:01,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:01,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:01,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:01,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:01,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:01,751 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2020-07-29 01:40:01,751 INFO L444 ModelExtractionUtils]: 12 out of 52 variables were initially zero. Simplification set additionally 37 variables to zero. 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:01,756 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:01,759 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:01,760 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:01,760 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2020-07-29 01:40:01,854 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-07-29 01:40:01,862 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~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset;" [2020-07-29 01:40:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:40:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:01,938 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,939 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,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~length1~0 < 1); {323#unseeded} is VALID [2020-07-29 01:40:01,941 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~length2~0 < 1); {323#unseeded} is VALID [2020-07-29 01:40:01,943 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:01,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:01,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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; {412#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:01,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {413#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:01,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} 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); {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:01,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {415#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:01,993 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:01,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:02,008 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,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:02,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:40:02,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2020-07-29 01:40:02,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:02,122 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:02,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:40:02,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:02,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:02,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-07-29 01:40:02,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,127 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:40:02,128 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:02,128 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:02,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:02,130 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:02,130 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:02,131 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:02,132 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,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,132 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,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:02,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:02,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:02,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,133 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,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,134 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,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,137 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,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:40:02,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,138 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,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,139 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,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:40:02,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,139 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,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:02,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:02,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:02,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,141 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,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:02,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,142 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,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,142 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,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:02,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,144 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,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,145 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,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,146 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,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:02,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:02,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:02,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,148 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,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:02,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,149 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,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,149 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,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:02,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,150 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,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,151 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,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:02,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,152 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,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,152 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:02,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:02,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:02,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:40:02,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:02,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:02,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-07-29 01:40:02,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:40:02,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:40:02,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:02,166 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:40:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-29 01:40:02,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:02,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:02,169 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:02,169 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:02,170 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,171 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:40:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,172 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:40:02,172 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:40:02,173 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,175 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:40:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:40:02,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:02,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:40:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 01:40:02,178 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:40:02,178 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:40:02,178 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:40:02,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:40:02,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,180 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,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:02,180 INFO L794 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 509#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; 510#L382 assume !(main_~length1~0 < 1); 511#L382-2 assume !(main_~length2~0 < 1); 508#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; 504#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 505#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; 518#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 514#L372-1 assume !cstrpbrk_#t~short210; 515#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; 500#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 501#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 502#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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 503#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 507#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; 517#L372-5 [2020-07-29 01:40:02,180 INFO L796 eck$LassoCheckResult]: Loop: 517#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 512#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); 513#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 517#L372-5 [2020-07-29 01:40:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-07-29 01:40:02,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641858934] [2020-07-29 01:40:02,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:02,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2020-07-29 01:40:02,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {648#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; {648#true} is VALID [2020-07-29 01:40:02,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {648#true} assume !(main_~length1~0 < 1); {648#true} is VALID [2020-07-29 01:40:02,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {648#true} assume !(main_~length2~0 < 1); {648#true} is VALID [2020-07-29 01:40:02,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {648#true} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; {648#true} is VALID [2020-07-29 01:40:02,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {648#true} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {650#(= |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,285 INFO L280 TraceCheckUtils]: 6: Hoare triple {650#(= |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; {651#(not (= 0 ULTIMATE.start_cstrpbrk_~c~0))} is VALID [2020-07-29 01:40:02,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {651#(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; {652#(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,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {652#(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; {653#(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,289 INFO L280 TraceCheckUtils]: 9: Hoare triple {653#(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~mem208;havoc cstrpbrk_#t~mem209; {653#(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,290 INFO L280 TraceCheckUtils]: 10: Hoare triple {653#(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); {654#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212| ULTIMATE.start_cstrpbrk_~c~0))} is VALID [2020-07-29 01:40:02,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {654#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212| ULTIMATE.start_cstrpbrk_~c~0))} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {649#false} is VALID [2020-07-29 01:40:02,292 INFO L280 TraceCheckUtils]: 12: Hoare triple {649#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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {649#false} is VALID [2020-07-29 01:40:02,292 INFO L280 TraceCheckUtils]: 13: Hoare triple {649#false} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {649#false} is VALID [2020-07-29 01:40:02,292 INFO L280 TraceCheckUtils]: 14: Hoare triple {649#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; {649#false} is VALID [2020-07-29 01:40:02,293 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,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641858934] [2020-07-29 01:40:02,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:40:02,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:40:02,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663483298] [2020-07-29 01:40:02,295 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:40:02,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-07-29 01:40:02,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042872557] [2020-07-29 01:40:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:02,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:40:02,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:40:02,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:40:02,426 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,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:02,659 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-29 01:40:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:40:02,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:40:02,685 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,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-07-29 01:40:02,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:40:02,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2020-07-29 01:40:02,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:40:02,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:40:02,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:02,690 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-29 01:40:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-29 01:40:02,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:02,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:02,693 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:02,693 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:02,694 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,696 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:40:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,697 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:40:02,697 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:40:02,698 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:02,700 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:40:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:40:02,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:02,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:02,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:02,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:40:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-29 01:40:02,703 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:40:02,703 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:40:02,703 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:40:02,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-07-29 01:40:02,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:02,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:02,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:02,705 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,705 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:02,705 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 704#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; 705#L382 assume !(main_~length1~0 < 1); 706#L382-2 assume !(main_~length2~0 < 1); 703#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; 699#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 700#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; 713#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 717#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); 716#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; 695#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 696#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 697#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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 698#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 702#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; 712#L372-5 [2020-07-29 01:40:02,706 INFO L796 eck$LassoCheckResult]: Loop: 712#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 708#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); 709#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 712#L372-5 [2020-07-29 01:40:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-07-29 01:40:02,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544199116] [2020-07-29 01:40:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,761 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,762 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-07-29 01:40:02,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339174633] [2020-07-29 01:40:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,773 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 L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-07-29 01:40:02,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:02,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156719642] [2020-07-29 01:40:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:02,881 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:02,896 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:03,697 WARN L193 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2020-07-29 01:40:03,988 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-07-29 01:40:03,992 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:03,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:03,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:03,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:03,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:03,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:03,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:03,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:03,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration5_Lasso [2020-07-29 01:40:03,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:03,993 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:04,029 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,032 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,035 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,039 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,042 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,045 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,050 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,060 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,064 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,180 WARN L193 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2020-07-29 01:40:05,308 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-29 01:40:05,321 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,323 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,328 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,332 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,335 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,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:05,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:05,361 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,363 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,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:05,370 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,010 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-07-29 01:40:06,702 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-07-29 01:40:07,222 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-07-29 01:40:07,444 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:40:07,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:07,564 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,572 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,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,649 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,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:07,677 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,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,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:07,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,742 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,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,768 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,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:07,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:07,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:07,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,794 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,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,796 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:40:07,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,823 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-07-29 01:40:07,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:07,898 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,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,934 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,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,963 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,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,993 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,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:08,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,023 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,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:08,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,058 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,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:08,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,097 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,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:08,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:08,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:08,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:08,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:08,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:08,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:08,139 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:40:08,139 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:08,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:40:08,143 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:08,144 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:08,144 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2020-07-29 01:40:08,297 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:40:08,303 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~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset;" [2020-07-29 01:40:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:40:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {843#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2020-07-29 01:40:08,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {843#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; {843#unseeded} is VALID [2020-07-29 01:40:08,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,408 INFO L280 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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; {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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); {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,419 INFO L280 TraceCheckUtils]: 11: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,420 INFO L280 TraceCheckUtils]: 13: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,421 INFO L280 TraceCheckUtils]: 14: Hoare triple {998#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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; {977#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {978#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1029#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:08,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {1029#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} 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); {1029#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:08,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {1029#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {980#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:08,468 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:08,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:08,489 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:08,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,490 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:08,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:08,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2020-07-29 01:40:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:08,599 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:08,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:40:08,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:08,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,605 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,606 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:08,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,607 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:08,608 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:08,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,609 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:08,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,609 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:08,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,610 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:08,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,611 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:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,611 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:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,612 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:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,612 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:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,612 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:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,613 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:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,614 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:08,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,614 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:08,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,614 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:08,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,615 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:08,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,615 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:08,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,616 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:08,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,617 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:08,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,617 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:08,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,618 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:08,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,618 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:08,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,619 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:08,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,619 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:08,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,620 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {843#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2020-07-29 01:40:08,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {843#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; {843#unseeded} is VALID [2020-07-29 01:40:08,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,726 INFO L280 TraceCheckUtils]: 5: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,727 INFO L280 TraceCheckUtils]: 6: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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; {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,728 INFO L280 TraceCheckUtils]: 7: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,729 INFO L280 TraceCheckUtils]: 8: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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); {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,730 INFO L280 TraceCheckUtils]: 9: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,730 INFO L280 TraceCheckUtils]: 10: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,731 INFO L280 TraceCheckUtils]: 11: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,732 INFO L280 TraceCheckUtils]: 14: Hoare triple {1104#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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; {977#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {978#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1135#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:08,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {1135#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} 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); {1135#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:08,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {1135#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {980#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:08,777 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:08,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:08,797 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:08,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,797 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:08,798 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:08,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2020-07-29 01:40:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:08,889 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:08,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:40:08,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:08,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,892 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,892 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,892 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:08,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,893 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:08,894 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:08,894 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,894 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:08,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,895 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:08,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,896 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:08,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,896 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:08,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,896 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:08,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,897 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:08,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,897 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:08,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,898 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:08,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,898 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:08,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,899 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:08,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,899 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:08,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,900 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:08,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,900 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:08,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,900 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:08,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,901 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:08,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,902 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:08,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,902 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:08,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,902 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:08,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,903 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:08,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,903 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:08,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,903 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:08,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,904 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {843#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2020-07-29 01:40:08,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {843#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; {843#unseeded} is VALID [2020-07-29 01:40:08,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,996 INFO L280 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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 + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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; {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,001 INFO L280 TraceCheckUtils]: 7: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,002 INFO L280 TraceCheckUtils]: 8: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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); {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,003 INFO L280 TraceCheckUtils]: 9: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209; {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,004 INFO L280 TraceCheckUtils]: 10: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,005 INFO L280 TraceCheckUtils]: 11: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,006 INFO L280 TraceCheckUtils]: 12: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,007 INFO L280 TraceCheckUtils]: 14: Hoare triple {1210#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) 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; {977#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {978#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; {1241#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:09,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {1241#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} 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 (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:09,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {1241#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;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, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {980#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:09,052 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,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:09,074 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,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,075 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:09,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:09,191 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2020-07-29 01:40:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:09,192 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:09,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2020-07-29 01:40:09,195 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,195 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,195 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:09,195 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:09,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,197 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:09,197 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,197 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:40:09,197 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,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,198 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,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,199 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,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,199 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,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,199 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,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,200 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,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:09,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:09,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:09,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,200 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,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,201 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,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,201 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,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,202 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,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,202 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,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,203 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,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,204 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:40:09,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:09,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:40:09,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,208 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-07-29 01:40:09,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:40:09,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:40:09,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:40:09,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:40:09,209 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,209 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,209 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,209 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:40:09,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:40:09,209 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,216 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,216 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:40:09,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:40:09,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:40:09,217 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:40:09,217 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:52" (3/4) ... [2020-07-29 01:40:09,221 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:40:09,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:40:09,223 INFO L168 Benchmark]: Toolchain (without parser) took 18297.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 389.0 MB). Free memory was 953.5 MB in the beginning and 859.2 MB in the end (delta: 94.3 MB). Peak memory consumption was 483.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,223 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:09,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.09 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,225 INFO L168 Benchmark]: Boogie Preprocessor took 31.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,225 INFO L168 Benchmark]: RCFGBuilder took 580.14 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,226 INFO L168 Benchmark]: BuchiAutomizer took 16929.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.2 MB). Free memory was 1.1 GB in the beginning and 859.2 MB in the end (delta: 220.7 MB). Peak memory consumption was 472.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,226 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 1.4 GB. Free memory is still 859.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:09,229 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 681.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.09 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. * Boogie Preprocessor took 31.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 580.14 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16929.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.2 MB). Free memory was 1.1 GB in the beginning and 859.2 MB in the end (delta: 220.7 MB). Peak memory consumption was 472.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.77 ms. Allocated memory is still 1.4 GB. Free memory is still 859.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. 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: 105 SDtfs, 124 SDslu, 72 SDs, 0 SdLazy, 102 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax100 hnf99 lsp106 ukn82 mio100 lsp33 div124 bol100 ite100 ukn100 eq170 hnf82 smp91 dnf668 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...