./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c --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-crafted-lit/cstrpbrk.c -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 eec7850a55859668859d25c9503478e74955da1a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:29:07,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:07,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:07,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:07,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:07,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:07,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:07,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:07,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:07,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:07,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:07,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:07,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:07,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:07,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:07,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:07,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:07,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:07,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:07,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:07,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:07,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:07,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:07,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:07,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:07,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:07,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:07,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:07,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:07,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:07,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:07,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:07,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:07,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:07,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:07,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:07,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:07,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:07,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:07,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:07,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:07,971 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:29:08,011 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:08,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:08,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:08,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:08,015 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:08,015 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:08,015 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:08,016 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:08,016 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:08,016 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:08,019 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:08,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:08,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:08,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:08,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:08,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:08,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:08,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:08,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:08,022 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:08,023 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:08,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:08,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:08,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:08,024 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:08,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:08,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:08,024 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:08,024 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:08,026 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:08,027 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 -> eec7850a55859668859d25c9503478e74955da1a [2020-07-29 01:29:08,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:08,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:08,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:08,362 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:08,363 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:08,363 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c [2020-07-29 01:29:08,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce048e78/dedff082654e49d893ab2e5768e51a46/FLAG30c7ead05 [2020-07-29 01:29:08,944 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:08,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c [2020-07-29 01:29:08,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce048e78/dedff082654e49d893ab2e5768e51a46/FLAG30c7ead05 [2020-07-29 01:29:09,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ce048e78/dedff082654e49d893ab2e5768e51a46 [2020-07-29 01:29:09,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:09,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:09,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:09,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:09,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:09,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c24cc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09, skipping insertion in model container [2020-07-29 01:29:09,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:09,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:09,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:09,632 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:09,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:09,670 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:09,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09 WrapperNode [2020-07-29 01:29:09,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:09,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:09,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:09,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:09,679 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:29:09" (1/1) ... [2020-07-29 01:29:09,749 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:29:09" (1/1) ... [2020-07-29 01:29:09,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:09,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:09,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:09,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:09,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (1/1) ... [2020-07-29 01:29:09,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:09,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:09,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:09,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:09,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (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:29:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:29:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:29:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:29:10,334 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:10,334 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-29 01:29:10,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:10 BoogieIcfgContainer [2020-07-29 01:29:10,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:10,339 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:10,340 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:10,344 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:10,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:10,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:09" (1/3) ... [2020-07-29 01:29:10,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e538f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:10, skipping insertion in model container [2020-07-29 01:29:10,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:10,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:09" (2/3) ... [2020-07-29 01:29:10,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e538f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:10, skipping insertion in model container [2020-07-29 01:29:10,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:10,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:10" (3/3) ... [2020-07-29 01:29:10,350 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk.c [2020-07-29 01:29:10,405 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:10,405 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:10,405 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:10,405 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:10,407 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:10,407 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:10,407 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:10,408 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:10,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 01:29:10,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:29:10,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:10,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:29:10,457 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:10,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 01:29:10,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:29:10,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,462 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:10,463 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:29:10,470 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 4#L31-4true [2020-07-29 01:29:10,470 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 23#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 6#L31-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 4#L31-4true [2020-07-29 01:29:10,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2020-07-29 01:29:10,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:10,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384409520] [2020-07-29 01:29:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:10,610 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:10,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:10,676 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2020-07-29 01:29:10,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:10,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491641565] [2020-07-29 01:29:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:10,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {27#true} is VALID [2020-07-29 01:29:10,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {27#true} is VALID [2020-07-29 01:29:10,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-29 01:29:10,731 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#false} call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {28#false} is VALID [2020-07-29 01:29:10,732 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#false} assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; {28#false} is VALID [2020-07-29 01:29:10,732 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#false} cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; {28#false} is VALID [2020-07-29 01:29:10,734 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:29:10,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491641565] [2020-07-29 01:29:10,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:10,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:29:10,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068091456] [2020-07-29 01:29:10,741 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:10,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:10,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:29:10,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:29:10,757 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-29 01:29:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:10,819 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-07-29 01:29:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:29:10,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:29:10,835 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:29:10,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2020-07-29 01:29:10,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:29:10,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2020-07-29 01:29:10,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:29:10,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:29:10,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-07-29 01:29:10,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:10,850 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:29:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-07-29 01:29:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:29:10,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:10,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:29:10,882 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:29:10,884 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:29:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:10,887 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 01:29:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:29:10,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:10,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:10,889 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 20 transitions. [2020-07-29 01:29:10,890 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 20 transitions. [2020-07-29 01:29:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:10,892 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 01:29:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:29:10,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:10,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:10,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:10,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:29:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 01:29:10,897 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:29:10,898 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:29:10,898 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:10,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:29:10,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:29:10,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:10,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:10,901 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:10,901 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:10,901 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 50#L31-4 [2020-07-29 01:29:10,902 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 56#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 57#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 61#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 52#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 50#L31-4 [2020-07-29 01:29:10,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:10,903 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2020-07-29 01:29:10,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:10,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445852811] [2020-07-29 01:29:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:10,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:10,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:11,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2020-07-29 01:29:11,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:11,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257522305] [2020-07-29 01:29:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:11,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:11,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:11,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:11,062 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2020-07-29 01:29:11,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:11,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262928415] [2020-07-29 01:29:11,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:11,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {105#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {105#true} is VALID [2020-07-29 01:29:11,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {105#true} havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {105#true} is VALID [2020-07-29 01:29:11,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {105#true} assume !(build_nondet_String_~length~0 < 1); {105#true} is VALID [2020-07-29 01:29:11,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {105#true} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {105#true} is VALID [2020-07-29 01:29:11,269 INFO L280 TraceCheckUtils]: 4: Hoare triple {105#true} main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {105#true} is VALID [2020-07-29 01:29:11,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {105#true} assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; {107#(= 1 ULTIMATE.start_build_nondet_String_~length~0)} is VALID [2020-07-29 01:29:11,273 INFO L280 TraceCheckUtils]: 6: Hoare triple {107#(= 1 ULTIMATE.start_build_nondet_String_~length~0)} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {108#(and (= 1 (select |#length| |ULTIMATE.start_build_nondet_String_#res.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res.base|) 0)))} is VALID [2020-07-29 01:29:11,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {108#(and (= 1 (select |#length| |ULTIMATE.start_build_nondet_String_#res.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res.base|) 0)))} main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; {109#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) 0)) (= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)))} is VALID [2020-07-29 01:29:11,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {109#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) 0)) (= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {109#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) 0)) (= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)))} is VALID [2020-07-29 01:29:11,279 INFO L280 TraceCheckUtils]: 9: Hoare triple {109#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) 0)) (= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {110#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) 0)) (= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:11,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {110#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) 0)) (= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {111#(not |ULTIMATE.start_cstrpbrk_#t~short7|)} is VALID [2020-07-29 01:29:11,282 INFO L280 TraceCheckUtils]: 11: Hoare triple {111#(not |ULTIMATE.start_cstrpbrk_#t~short7|)} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {106#false} is VALID [2020-07-29 01:29:11,283 INFO L280 TraceCheckUtils]: 12: Hoare triple {106#false} assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; {106#false} is VALID [2020-07-29 01:29:11,283 INFO L280 TraceCheckUtils]: 13: Hoare triple {106#false} call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {106#false} is VALID [2020-07-29 01:29:11,283 INFO L280 TraceCheckUtils]: 14: Hoare triple {106#false} assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; {106#false} is VALID [2020-07-29 01:29:11,284 INFO L280 TraceCheckUtils]: 15: Hoare triple {106#false} cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; {106#false} is VALID [2020-07-29 01:29:11,287 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:29:11,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262928415] [2020-07-29 01:29:11,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:11,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:29:11,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147320742] [2020-07-29 01:29:11,501 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-29 01:29:11,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:11,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:29:11,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:29:11,650 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-07-29 01:29:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:12,123 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-29 01:29:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:29:12,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:29:12,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:12,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2020-07-29 01:29:12,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 01:29:12,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2020-07-29 01:29:12,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-29 01:29:12,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-29 01:29:12,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2020-07-29 01:29:12,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:12,162 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 01:29:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2020-07-29 01:29:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-29 01:29:12,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:12,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 35 transitions. Second operand 27 states. [2020-07-29 01:29:12,165 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 35 transitions. Second operand 27 states. [2020-07-29 01:29:12,165 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 27 states. [2020-07-29 01:29:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:12,168 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-29 01:29:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-29 01:29:12,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:12,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:12,169 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 31 states and 35 transitions. [2020-07-29 01:29:12,169 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 31 states and 35 transitions. [2020-07-29 01:29:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:12,172 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-29 01:29:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-29 01:29:12,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:12,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:12,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:12,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:29:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-29 01:29:12,176 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:29:12,177 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:29:12,177 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:12,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-07-29 01:29:12,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 01:29:12,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:12,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:12,179 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:12,179 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:12,179 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 166#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 167#L14 assume !(build_nondet_String_~length~0 < 1); 171#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 160#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 161#L14-3 assume !(build_nondet_String_~length~0 < 1); 163#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 164#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 176#L31-4 [2020-07-29 01:29:12,180 INFO L796 eck$LassoCheckResult]: Loop: 176#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 175#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 158#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 159#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 172#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 173#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 178#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 177#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 176#L31-4 [2020-07-29 01:29:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2020-07-29 01:29:12,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019803299] [2020-07-29 01:29:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2020-07-29 01:29:12,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943864356] [2020-07-29 01:29:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2020-07-29 01:29:12,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:12,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218082820] [2020-07-29 01:29:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:12,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:12,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:12,608 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-29 01:29:13,131 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2020-07-29 01:29:13,474 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 01:29:13,489 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:13,490 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:13,490 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:13,490 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:13,490 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:13,490 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,491 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:13,492 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:13,492 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration3_Lasso [2020-07-29 01:29:13,492 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:13,492 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:13,563 INFO L141 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:29:13,571 INFO L141 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:29:13,575 INFO L141 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:29:13,581 INFO L141 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:29:13,585 INFO L141 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:29:13,593 INFO L141 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:29:13,598 INFO L141 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:29:13,602 INFO L141 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:29:13,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,612 INFO L141 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:29:13,617 INFO L141 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:29:13,621 INFO L141 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:29:13,625 INFO L141 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:29:13,630 INFO L141 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:29:13,633 INFO L141 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:29:13,637 INFO L141 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:29:13,642 INFO L141 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:29:13,976 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2020-07-29 01:29:14,146 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-07-29 01:29:14,154 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:29:14,155 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:29:14,162 INFO L141 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:29:14,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:15,385 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-07-29 01:29:15,665 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2020-07-29 01:29:15,808 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:15,814 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:29:15,827 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:29:15,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:15,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:15,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:15,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:15,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:15,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:15,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:15,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,864 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:29:15,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:15,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:15,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:15,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:15,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:15,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:15,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:15,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,914 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:29:15,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:15,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:15,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:15,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:15,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:15,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:15,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:15,918 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:29:15,966 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:29:15,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:15,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:15,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:15,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:15,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:15,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:15,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,011 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:29:16,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,057 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:29:16,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,084 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:29:16,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,093 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:29:16,136 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:29:16,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,140 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:29:16,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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,185 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:29:16,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,189 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:29:16,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,229 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:29:16,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,237 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:29:16,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:16,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:16,295 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:29:16,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,325 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:29:16,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,330 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:29:16,354 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:29:16,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,383 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:29:16,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,410 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:29:16,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,417 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:29:16,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:16,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,463 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:29:16,486 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:29:16,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:16,517 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:29:16,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,519 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:29:16,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,537 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-07-29 01:29:16,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,564 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:29:16,588 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:29:16,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:16,594 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:29:16,618 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:29:16,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,631 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:29:16,670 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:29:16,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,681 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) [2020-07-29 01:29:16,721 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:29:16,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,765 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:17,028 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:29:17,029 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. 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:29:17,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:17,062 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:29:17,063 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:17,063 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2020-07-29 01:29:17,183 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 01:29:17,195 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);" "assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4;" "call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5;" "assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;" "call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);" "assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9;" "cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;" [2020-07-29 01:29:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:29:17,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:17,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {250#unseeded} is VALID [2020-07-29 01:29:17,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#unseeded} havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {250#unseeded} is VALID [2020-07-29 01:29:17,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {250#unseeded} assume !(build_nondet_String_~length~0 < 1); {250#unseeded} is VALID [2020-07-29 01:29:17,354 INFO L280 TraceCheckUtils]: 3: Hoare triple {250#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {250#unseeded} is VALID [2020-07-29 01:29:17,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#unseeded} main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {250#unseeded} is VALID [2020-07-29 01:29:17,355 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#unseeded} assume !(build_nondet_String_~length~0 < 1); {250#unseeded} is VALID [2020-07-29 01:29:17,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {250#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {250#unseeded} is VALID [2020-07-29 01:29:17,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {250#unseeded} main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; {299#(and (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base) unseeded)} is VALID [2020-07-29 01:29:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:17,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#(and (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~sc1~0.offset))))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} is VALID [2020-07-29 01:29:17,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} is VALID [2020-07-29 01:29:17,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} is VALID [2020-07-29 01:29:17,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} is VALID [2020-07-29 01:29:17,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} is VALID [2020-07-29 01:29:17,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} is VALID [2020-07-29 01:29:17,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} is VALID [2020-07-29 01:29:17,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {329#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)) (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base))} cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; {302#(and (= |ULTIMATE.start_main_#t~ret10.base| ULTIMATE.start_cstrpbrk_~sc1~0.base) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~ret10.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~sc1~0.offset)))) unseeded))} is VALID [2020-07-29 01:29:17,488 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:29:17,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:17,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:17,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,525 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:29:17,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:29:17,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2020-07-29 01:29:17,716 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:29:17,716 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:17,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. cyclomatic complexity: 6 [2020-07-29 01:29:17,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:17,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:17,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2020-07-29 01:29:17,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:17,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,727 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 31 transitions. cyclomatic complexity: 6 [2020-07-29 01:29:17,733 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2020-07-29 01:29:17,733 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:17,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:17,735 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:17,735 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 52 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:17,736 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:17,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:29:17,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:29:17,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:29:17,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:17,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:29:17,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:29:17,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:29:17,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:29:17,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:29:17,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:29:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:29:17,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:29:17,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:29:17,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:29:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:29:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:29:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:29:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:29:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:29:17,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:29:17,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:29:17,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:29:17,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:29:17,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:29:17,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:29:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:29:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:29:17,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:29:17,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:29:17,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:29:17,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:29:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:29:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:29:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:29:17,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:29:17,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:29:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:29:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:17,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:29:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:29:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:29:17,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:17,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:17,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:17,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:17,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:17,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:17,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 52 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:17,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,772 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2020-07-29 01:29:17,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:17,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2020-07-29 01:29:17,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2020-07-29 01:29:17,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:17,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:17,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2020-07-29 01:29:17,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:29:17,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:29:17,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-07-29 01:29:17,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:17,780 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 01:29:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-07-29 01:29:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-29 01:29:17,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:17,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 27 transitions. Second operand 22 states. [2020-07-29 01:29:17,783 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 27 transitions. Second operand 22 states. [2020-07-29 01:29:17,783 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 22 states. [2020-07-29 01:29:17,783 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:17,787 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-29 01:29:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-29 01:29:17,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:17,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:17,787 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states and 27 transitions. [2020-07-29 01:29:17,787 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states and 27 transitions. [2020-07-29 01:29:17,788 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:17,790 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-29 01:29:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-29 01:29:17,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:17,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:17,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:17,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:29:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-29 01:29:17,792 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 01:29:17,792 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 01:29:17,792 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:17,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-07-29 01:29:17,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:17,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:17,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:17,794 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 419#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 420#L14 assume !(build_nondet_String_~length~0 < 1); 423#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 414#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 415#L14-3 assume !(build_nondet_String_~length~0 < 1); 416#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 409#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 402#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 404#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 410#L34-5 [2020-07-29 01:29:17,794 INFO L796 eck$LassoCheckResult]: Loop: 410#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 411#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 417#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 410#L34-5 [2020-07-29 01:29:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2020-07-29 01:29:17,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:17,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895676875] [2020-07-29 01:29:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,862 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2020-07-29 01:29:17,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:17,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266710409] [2020-07-29 01:29:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2020-07-29 01:29:17,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:17,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921605623] [2020-07-29 01:29:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:18,667 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2020-07-29 01:29:19,019 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-07-29 01:29:19,025 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:19,026 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:19,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:19,026 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:19,026 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:19,026 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,026 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:19,026 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:19,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration4_Lasso [2020-07-29 01:29:19,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:19,026 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:19,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:29:19,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:29:19,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:19,072 INFO L141 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:29:19,076 INFO L141 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:29:19,440 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-07-29 01:29:19,544 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:29:19,544 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:29:19,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:19,552 INFO L141 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:29:19,555 INFO L141 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:29:19,559 INFO L141 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:29:19,562 INFO L141 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:29:19,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:19,569 INFO L141 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:29:19,571 INFO L141 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:29:19,577 INFO L141 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:29:19,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:19,584 INFO L141 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:29:19,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:19,590 INFO L141 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:29:19,593 INFO L141 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:29:20,835 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2020-07-29 01:29:21,130 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:29:21,260 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:21,260 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,270 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:29:21,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:21,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,307 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:29:21,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,311 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:29:21,351 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:29:21,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:21,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,378 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:21,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:21,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:21,381 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:29:21,403 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:29:21,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:21,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:21,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:21,500 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-07-29 01:29:21,500 INFO L444 ModelExtractionUtils]: 13 out of 46 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:21,502 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:21,504 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:29:21,504 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:21,505 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2020-07-29 01:29:21,567 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:29:21,572 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5;" "assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset;" [2020-07-29 01:29:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:29:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:29:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:21,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {535#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {535#unseeded} is VALID [2020-07-29 01:29:21,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {535#unseeded} havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {535#unseeded} is VALID [2020-07-29 01:29:21,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {535#unseeded} assume !(build_nondet_String_~length~0 < 1); {535#unseeded} is VALID [2020-07-29 01:29:21,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {535#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {535#unseeded} is VALID [2020-07-29 01:29:21,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {535#unseeded} main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {535#unseeded} is VALID [2020-07-29 01:29:21,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {535#unseeded} assume !(build_nondet_String_~length~0 < 1); {535#unseeded} is VALID [2020-07-29 01:29:21,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {535#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {621#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} is VALID [2020-07-29 01:29:21,681 INFO L280 TraceCheckUtils]: 7: Hoare triple {621#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; {625#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:21,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {625#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {625#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:21,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {625#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {594#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) unseeded)} is VALID [2020-07-29 01:29:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:21,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {632#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:21,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {632#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:21,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; {597#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:29:21,736 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:29:21,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:21,754 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:29:21,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,754 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 01:29:21,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-29 01:29:21,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2020-07-29 01:29:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:21,908 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:21,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:21,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:21,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:21,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:21,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:21,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:21,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:21,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 59 transitions. [2020-07-29 01:29:21,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:21,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:21,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:21,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:21,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:21,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:21,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:21,914 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:21,914 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 59 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:21,915 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:29:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:29:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:29:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:29:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:29:21,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:29:21,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:21,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:21,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:21,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:21,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:21,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:21,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:21,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:21,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:21,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:21,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:21,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:21,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:21,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:21,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 59 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:21,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,931 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 01:29:21,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:21,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:21,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:29:21,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:21,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:21,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:21,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2020-07-29 01:29:21,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:29:21,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:29:21,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2020-07-29 01:29:21,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:21,939 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-07-29 01:29:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2020-07-29 01:29:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-07-29 01:29:21,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:21,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 42 transitions. Second operand 27 states. [2020-07-29 01:29:21,942 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 42 transitions. Second operand 27 states. [2020-07-29 01:29:21,942 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 27 states. [2020-07-29 01:29:21,942 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:21,945 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-29 01:29:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-29 01:29:21,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:21,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:21,946 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 35 states and 42 transitions. [2020-07-29 01:29:21,946 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 35 states and 42 transitions. [2020-07-29 01:29:21,947 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:21,949 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-29 01:29:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-29 01:29:21,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:21,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:21,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:21,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:29:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-07-29 01:29:21,952 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-29 01:29:21,952 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-29 01:29:21,952 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:21,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2020-07-29 01:29:21,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:21,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:21,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:21,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:21,954 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:21,954 INFO L794 eck$LassoCheckResult]: Stem: 722#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 720#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 721#L14 assume !(build_nondet_String_~length~0 < 1); 724#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 714#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 715#L14-3 assume !(build_nondet_String_~length~0 < 1); 717#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 709#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 701#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 702#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 716#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 723#L34-1 assume !cstrpbrk_#t~short7; 719#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 706#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 707#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 708#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 703#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 705#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 710#L34-5 [2020-07-29 01:29:21,954 INFO L796 eck$LassoCheckResult]: Loop: 710#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 711#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 718#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 710#L34-5 [2020-07-29 01:29:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2020-07-29 01:29:21,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:21,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666914515] [2020-07-29 01:29:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:22,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {877#true} is VALID [2020-07-29 01:29:22,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {877#true} is VALID [2020-07-29 01:29:22,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} assume !(build_nondet_String_~length~0 < 1); {877#true} is VALID [2020-07-29 01:29:22,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {877#true} is VALID [2020-07-29 01:29:22,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {877#true} is VALID [2020-07-29 01:29:22,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume !(build_nondet_String_~length~0 < 1); {877#true} is VALID [2020-07-29 01:29:22,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#true} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {877#true} is VALID [2020-07-29 01:29:22,036 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#true} main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; {877#true} is VALID [2020-07-29 01:29:22,038 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {879#(= |ULTIMATE.start_cstrpbrk_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:29:22,039 INFO L280 TraceCheckUtils]: 9: Hoare triple {879#(= |ULTIMATE.start_cstrpbrk_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {880#(not (= 0 ULTIMATE.start_cstrpbrk_~c~0))} is VALID [2020-07-29 01:29:22,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#(not (= 0 ULTIMATE.start_cstrpbrk_~c~0))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {881#(or |ULTIMATE.start_cstrpbrk_#t~short7| (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:29:22,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {881#(or |ULTIMATE.start_cstrpbrk_#t~short7| (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~short7; {882#(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:29:22,049 INFO L280 TraceCheckUtils]: 12: Hoare triple {882#(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~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; {882#(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:29:22,050 INFO L280 TraceCheckUtils]: 13: Hoare triple {882#(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~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {883#(not (= ULTIMATE.start_cstrpbrk_~c~0 |ULTIMATE.start_cstrpbrk_#t~mem9|))} is VALID [2020-07-29 01:29:22,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {883#(not (= ULTIMATE.start_cstrpbrk_~c~0 |ULTIMATE.start_cstrpbrk_#t~mem9|))} assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; {878#false} is VALID [2020-07-29 01:29:22,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {878#false} cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; {878#false} is VALID [2020-07-29 01:29:22,051 INFO L280 TraceCheckUtils]: 16: Hoare triple {878#false} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {878#false} is VALID [2020-07-29 01:29:22,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {878#false} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {878#false} is VALID [2020-07-29 01:29:22,052 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:29:22,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666914515] [2020-07-29 01:29:22,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:22,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:29:22,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299382507] [2020-07-29 01:29:22,053 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:29:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,054 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2020-07-29 01:29:22,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597943400] [2020-07-29 01:29:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:22,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:29:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:29:22,186 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 01:29:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:22,389 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-29 01:29:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:29:22,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:29:22,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:22,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2020-07-29 01:29:22,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:22,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2020-07-29 01:29:22,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:29:22,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:29:22,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2020-07-29 01:29:22,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:22,416 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:29:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2020-07-29 01:29:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-29 01:29:22,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:22,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 31 transitions. Second operand 27 states. [2020-07-29 01:29:22,419 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 31 transitions. Second operand 27 states. [2020-07-29 01:29:22,419 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 27 states. [2020-07-29 01:29:22,420 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:22,422 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-29 01:29:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-29 01:29:22,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:22,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:22,423 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states and 31 transitions. [2020-07-29 01:29:22,423 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states and 31 transitions. [2020-07-29 01:29:22,424 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:22,425 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-29 01:29:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-29 01:29:22,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:22,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:22,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:22,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:29:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-29 01:29:22,428 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:29:22,428 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:29:22,429 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:22,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-07-29 01:29:22,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:22,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:22,430 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:22,431 INFO L794 eck$LassoCheckResult]: Stem: 945#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 943#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 944#L14 assume !(build_nondet_String_~length~0 < 1); 948#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 937#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 938#L14-3 assume !(build_nondet_String_~length~0 < 1); 939#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 932#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; 924#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 925#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 942#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 946#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 947#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 929#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 930#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 931#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 926#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 928#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 933#L34-5 [2020-07-29 01:29:22,431 INFO L796 eck$LassoCheckResult]: Loop: 933#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 934#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 940#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 933#L34-5 [2020-07-29 01:29:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2020-07-29 01:29:22,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854956293] [2020-07-29 01:29:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:22,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,481 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2020-07-29 01:29:22,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538072496] [2020-07-29 01:29:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,500 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2020-07-29 01:29:22,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458205269] [2020-07-29 01:29:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:23,549 WARN L193 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 157 [2020-07-29 01:29:25,112 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 127 DAG size of output: 127 [2020-07-29 01:29:25,118 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:25,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:25,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:25,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:25,118 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:25,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:25,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:25,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration6_Lasso [2020-07-29 01:29:25,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:25,119 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:25,176 INFO L141 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:29:25,179 INFO L141 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:29:25,183 INFO L141 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:29:25,186 INFO L141 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:29:25,189 INFO L141 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:29:25,193 INFO L141 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:29:25,199 INFO L141 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:29:25,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:29:25,205 INFO L141 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:29:25,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:25,214 INFO L141 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:29:25,217 INFO L141 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:29:25,221 INFO L141 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:29:25,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2020-07-29 01:29:26,441 WARN L193 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2020-07-29 01:29:26,572 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-07-29 01:29:26,574 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 01:29:26,575 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 01:29:26,585 INFO L141 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:29:26,589 INFO L141 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:29:26,594 INFO L141 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:29:26,597 INFO L141 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:29:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:26,605 INFO L141 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:29:27,183 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2020-07-29 01:29:27,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2020-07-29 01:29:28,121 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2020-07-29 01:29:28,357 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:29:28,917 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2020-07-29 01:29:29,173 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:29,175 INFO L489 LassoAnalysis]: Using template 'affine'. 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:29:29,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:29,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:29,204 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:29:29,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:29,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:29,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,233 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) [2020-07-29 01:29:29,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:29,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:29,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:29,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:29,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:29,292 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:29:29,315 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:29:29,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:29,342 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:29:29,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,349 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:29:29,380 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:29:29,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:29,411 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:29:29,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,415 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:29:29,438 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:29:29,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:29,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:29,444 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:29:29,469 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:29:29,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:29,496 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:29:29,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:29,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:29,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:29,499 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:29:29,521 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:29:29,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:29,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:29,528 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:29:29,555 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:29:29,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:29,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:29,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:29,561 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:29:29,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:29,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,587 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:29:29,587 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 01:29:29,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,665 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2020-07-29 01:29:29,665 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 01:29:29,891 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:29:29,915 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:29:29,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:29,917 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:29:29,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:29,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:29,942 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-07-29 01:29:29,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:29,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:30,011 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:29:30,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:30,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:30,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:30,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:30,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:30,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:30,104 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:29:30,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:30,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:30,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:30,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:30,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:30,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:30,203 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 01:29:30,203 INFO L444 ModelExtractionUtils]: 29 out of 46 variables were initially zero. Simplification set additionally 14 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) [2020-07-29 01:29:30,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:30,224 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:29:30,224 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:30,224 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2020-07-29 01:29:30,422 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-07-29 01:29:30,430 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5;" "assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset;" [2020-07-29 01:29:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,438 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:29:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:29:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:30,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {1082#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1082#unseeded} is VALID [2020-07-29 01:29:30,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {1082#unseeded} havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {1082#unseeded} is VALID [2020-07-29 01:29:30,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {1082#unseeded} assume !(build_nondet_String_~length~0 < 1); {1082#unseeded} is VALID [2020-07-29 01:29:30,594 INFO L280 TraceCheckUtils]: 3: Hoare triple {1082#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {1082#unseeded} is VALID [2020-07-29 01:29:30,595 INFO L280 TraceCheckUtils]: 4: Hoare triple {1082#unseeded} main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {1082#unseeded} is VALID [2020-07-29 01:29:30,596 INFO L280 TraceCheckUtils]: 5: Hoare triple {1082#unseeded} assume !(build_nondet_String_~length~0 < 1); {1082#unseeded} is VALID [2020-07-29 01:29:30,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {1082#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {1208#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} is VALID [2020-07-29 01:29:30,599 INFO L280 TraceCheckUtils]: 7: Hoare triple {1208#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,601 INFO L280 TraceCheckUtils]: 8: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,602 INFO L280 TraceCheckUtils]: 9: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,603 INFO L280 TraceCheckUtils]: 10: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,606 INFO L280 TraceCheckUtils]: 12: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,609 INFO L280 TraceCheckUtils]: 15: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,610 INFO L280 TraceCheckUtils]: 16: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:30,612 INFO L280 TraceCheckUtils]: 17: Hoare triple {1212#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {1181#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) unseeded)} is VALID [2020-07-29 01:29:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:30,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {1182#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {1243#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:30,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {1243#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1243#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:30,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {1243#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; {1184#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:29:30,672 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:29:30,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:30,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:30,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,705 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 01:29:30,705 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-29 01:29:30,857 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2020-07-29 01:29:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:30,857 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:30,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:30,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:30,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:30,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:30,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:30,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:30,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:30,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2020-07-29 01:29:30,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:30,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:30,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:30,861 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 31 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:30,861 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:30,861 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:30,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:30,862 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:30,863 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 48 transitions. cyclomatic complexity: 8 [2020-07-29 01:29:30,863 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:30,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:29:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:29:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:29:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:30,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:30,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:30,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:30,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,873 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:29:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:30,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:30,875 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:29:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:30,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:30,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {1082#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1082#unseeded} is VALID [2020-07-29 01:29:30,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {1082#unseeded} havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {1082#unseeded} is VALID [2020-07-29 01:29:30,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {1082#unseeded} assume !(build_nondet_String_~length~0 < 1); {1082#unseeded} is VALID [2020-07-29 01:29:30,996 INFO L280 TraceCheckUtils]: 3: Hoare triple {1082#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {1082#unseeded} is VALID [2020-07-29 01:29:30,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {1082#unseeded} main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {1082#unseeded} is VALID [2020-07-29 01:29:30,997 INFO L280 TraceCheckUtils]: 5: Hoare triple {1082#unseeded} assume !(build_nondet_String_~length~0 < 1); {1082#unseeded} is VALID [2020-07-29 01:29:30,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {1082#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {1329#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} is VALID [2020-07-29 01:29:31,000 INFO L280 TraceCheckUtils]: 7: Hoare triple {1329#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,002 INFO L280 TraceCheckUtils]: 9: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,003 INFO L280 TraceCheckUtils]: 10: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,004 INFO L280 TraceCheckUtils]: 11: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,005 INFO L280 TraceCheckUtils]: 12: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,007 INFO L280 TraceCheckUtils]: 14: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,008 INFO L280 TraceCheckUtils]: 15: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,009 INFO L280 TraceCheckUtils]: 16: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,010 INFO L280 TraceCheckUtils]: 17: Hoare triple {1333#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {1181#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) unseeded)} is VALID [2020-07-29 01:29:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:31,059 INFO L280 TraceCheckUtils]: 0: Hoare triple {1182#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {1364#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:31,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {1364#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1364#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:31,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {1364#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; {1184#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:29:31,062 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:29:31,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:31,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:31,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,086 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 01:29:31,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-29 01:29:31,236 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2020-07-29 01:29:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:31,236 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:31,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:31,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:31,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:31,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:31,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:31,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:31,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:31,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2020-07-29 01:29:31,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:31,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:31,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:31,241 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 31 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:31,241 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:31,241 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:31,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:31,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:31,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 48 transitions. cyclomatic complexity: 8 [2020-07-29 01:29:31,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:31,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:29:31,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:29:31,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:29:31,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:31,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:31,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:31,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:31,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:31,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 48 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,265 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:29:31,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,267 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:29:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:31,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {1082#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1082#unseeded} is VALID [2020-07-29 01:29:31,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {1082#unseeded} havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {1082#unseeded} is VALID [2020-07-29 01:29:31,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {1082#unseeded} assume !(build_nondet_String_~length~0 < 1); {1082#unseeded} is VALID [2020-07-29 01:29:31,408 INFO L280 TraceCheckUtils]: 3: Hoare triple {1082#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {1082#unseeded} is VALID [2020-07-29 01:29:31,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {1082#unseeded} main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; {1082#unseeded} is VALID [2020-07-29 01:29:31,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {1082#unseeded} assume !(build_nondet_String_~length~0 < 1); {1082#unseeded} is VALID [2020-07-29 01:29:31,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {1082#unseeded} call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {1450#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} is VALID [2020-07-29 01:29:31,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {1450#(and (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| |ULTIMATE.start_build_nondet_String_#res.base|) unseeded)} main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, 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; {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,431 INFO L280 TraceCheckUtils]: 9: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,433 INFO L280 TraceCheckUtils]: 11: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,434 INFO L280 TraceCheckUtils]: 12: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,435 INFO L280 TraceCheckUtils]: 13: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,436 INFO L280 TraceCheckUtils]: 14: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,437 INFO L280 TraceCheckUtils]: 15: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,438 INFO L280 TraceCheckUtils]: 16: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:29:31,443 INFO L280 TraceCheckUtils]: 17: Hoare triple {1454#(and unseeded (= |ULTIMATE.start_build_nondet_String_#t~malloc1.base| ULTIMATE.start_cstrpbrk_~s2.base))} assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; {1181#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) unseeded)} is VALID [2020-07-29 01:29:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:31,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:31,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {1182#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))))} call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; {1485#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:31,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {1485#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1485#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:29:31,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {1485#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; {1184#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_build_nondet_String_#t~malloc1.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:29:31,570 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:29:31,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:31,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:31,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,596 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 01:29:31,596 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-29 01:29:31,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2020-07-29 01:29:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:31,757 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:31,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:31,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:31,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:31,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:31,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:31,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:31,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:31,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2020-07-29 01:29:31,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:31,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:31,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 31 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:31,760 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:31,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:31,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:31,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:31,762 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 48 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:31,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:31,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:31,762 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:31,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:29:31,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:29:31,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:29:31,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:31,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:31,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:31,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:31,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:31,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:31,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:29:31,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:29:31,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 31 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:31,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,773 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-29 01:29:31,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:29:31,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:29:31,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2020-07-29 01:29:31,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:31,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. cyclomatic complexity: 9 [2020-07-29 01:29:31,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:31,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2020-07-29 01:29:31,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:31,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:31,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:31,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:31,779 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:31,779 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:31,780 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:31,780 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:29:31,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:31,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:31,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:31,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:31 BoogieIcfgContainer [2020-07-29 01:29:31,787 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:31,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:31,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:31,788 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:31,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:10" (3/4) ... [2020-07-29 01:29:31,793 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:31,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:31,795 INFO L168 Benchmark]: Toolchain (without parser) took 22478.22 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 477.6 MB). Free memory was 956.2 MB in the beginning and 1.4 GB in the end (delta: -468.6 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:31,796 INFO L168 Benchmark]: CDTParser took 0.29 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:29:31,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.34 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:31,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:31,797 INFO L168 Benchmark]: Boogie Preprocessor took 34.29 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:31,798 INFO L168 Benchmark]: RCFGBuilder took 523.21 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:31,799 INFO L168 Benchmark]: BuchiAutomizer took 21448.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -327.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:31,799 INFO L168 Benchmark]: Witness Printer took 5.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:31,802 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.29 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 351.34 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.29 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 523.21 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21448.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -327.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 18.0s. Construction of modules took 0.4s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 129 SDtfs, 161 SDslu, 143 SDs, 0 SdLazy, 204 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital342 mio100 ax100 hnf99 lsp137 ukn58 mio100 lsp42 div118 bol100 ite100 ukn100 eq166 hnf86 smp83 dnf734 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 307ms VariablesStem: 10 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...