./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bb7c0b0be083ae28de17688b83fb766e3f101f5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:35,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:35:35,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:35:35,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:35:35,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:35:35,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:35:35,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:35:35,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:35:35,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:35:35,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:35:35,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:35:35,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:35:35,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:35:35,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:35:35,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:35:35,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:35:35,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:35:35,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:35:35,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:35:35,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:35:35,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:35:35,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:35:35,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:35:35,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:35:35,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:35:35,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:35:35,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:35:35,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:35:35,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:35:35,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:35:35,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:35:35,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:35:35,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:35:35,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:35:35,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:35:35,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:35:35,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:35:35,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:35:35,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:35:35,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:35:35,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:35:35,713 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:35:35,743 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:35:35,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:35:35,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:35:35,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:35:35,747 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:35:35,747 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:35:35,748 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:35:35,748 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:35:35,748 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:35:35,748 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:35:35,750 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:35:35,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:35:35,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:35:35,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:35:35,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:35:35,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:35:35,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:35:35,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:35:35,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:35:35,752 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:35:35,753 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:35:35,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:35:35,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:35:35,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:35:35,754 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:35:35,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:35:35,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:35:35,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:35:35,755 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:35:35,757 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:35:35,757 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb7c0b0be083ae28de17688b83fb766e3f101f5 [2020-07-29 01:35:36,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:35:36,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:35:36,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:35:36,093 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:35:36,093 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:35:36,094 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2020-07-29 01:35:36,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882f131d3/8f57bf9c6a204a0a8172beeabb908684/FLAG8d6668938 [2020-07-29 01:35:36,780 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:35:36,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2020-07-29 01:35:36,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882f131d3/8f57bf9c6a204a0a8172beeabb908684/FLAG8d6668938 [2020-07-29 01:35:37,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/882f131d3/8f57bf9c6a204a0a8172beeabb908684 [2020-07-29 01:35:37,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:35:37,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:35:37,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:37,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:35:37,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:35:37,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b822c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37, skipping insertion in model container [2020-07-29 01:35:37,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:35:37,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:35:37,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:37,560 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:35:37,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:37,672 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:35:37,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37 WrapperNode [2020-07-29 01:35:37,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:37,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:37,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:35:37,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:35:37,687 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:35:37" (1/1) ... [2020-07-29 01:35:37,729 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:35:37" (1/1) ... [2020-07-29 01:35:37,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:37,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:35:37,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:35:37,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:35:37,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (1/1) ... [2020-07-29 01:35:37,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:35:37,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:35:37,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:35:37,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:35:37,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (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:35:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:35:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:35:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:35:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:35:37,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:35:37,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:35:38,322 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:35:38,322 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:35:38,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:38 BoogieIcfgContainer [2020-07-29 01:35:38,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:35:38,327 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:35:38,327 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:35:38,330 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:35:38,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:38,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:35:37" (1/3) ... [2020-07-29 01:35:38,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26aac3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:38, skipping insertion in model container [2020-07-29 01:35:38,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:38,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:37" (2/3) ... [2020-07-29 01:35:38,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26aac3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:38, skipping insertion in model container [2020-07-29 01:35:38,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:38,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:38" (3/3) ... [2020-07-29 01:35:38,335 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-2.i [2020-07-29 01:35:38,386 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:35:38,386 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:35:38,386 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:35:38,386 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:35:38,387 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:35:38,387 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:35:38,387 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:35:38,387 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:35:38,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:35:38,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:35:38,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:38,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:38,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:38,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:38,431 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:35:38,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:35:38,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:35:38,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:38,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:38,436 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:38,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:38,442 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 3#L552-4true [2020-07-29 01:35:38,443 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 5#L557true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 20#L552-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 3#L552-4true [2020-07-29 01:35:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:35:38,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36548456] [2020-07-29 01:35:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-07-29 01:35:38,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091507937] [2020-07-29 01:35:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:38,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {24#true} is VALID [2020-07-29 01:35:38,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {24#true} is VALID [2020-07-29 01:35:38,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-29 01:35:38,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {25#false} is VALID [2020-07-29 01:35:38,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {25#false} is VALID [2020-07-29 01:35:38,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {25#false} is VALID [2020-07-29 01:35:38,707 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:35:38,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091507937] [2020-07-29 01:35:38,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:38,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:35:38,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526091754] [2020-07-29 01:35:38,715 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:38,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:38,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:35:38,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:35:38,730 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-29 01:35:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:38,786 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:35:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:35:38,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:35:38,802 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:35:38,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:35:38,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:35:38,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-07-29 01:35:38,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:35:38,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:35:38,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:35:38,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:38,816 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:35:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:35:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:35:38,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:38,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:35:38,847 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:35:38,848 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:35:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:38,851 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:35:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:35:38,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:38,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:38,853 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:35:38,853 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:35:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:38,855 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:35:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:35:38,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:38,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:38,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:38,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:35:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:35:38,860 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:35:38,861 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:35:38,861 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:38,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:35:38,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:35:38,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:38,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:38,863 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:38,863 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:38,863 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 44#L552-4 [2020-07-29 01:35:38,864 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 51#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 55#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 46#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 47#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 44#L552-4 [2020-07-29 01:35:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,865 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:35:38,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520764945] [2020-07-29 01:35:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,912 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-07-29 01:35:38,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751349254] [2020-07-29 01:35:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:38,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:38,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-07-29 01:35:38,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:38,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081002207] [2020-07-29 01:35:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:39,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:39,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:39,343 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-29 01:35:39,850 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2020-07-29 01:35:40,005 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-07-29 01:35:40,020 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:40,021 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:40,021 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:40,021 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:40,021 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:40,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:40,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:40,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:40,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration2_Lasso [2020-07-29 01:35:40,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:40,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:40,098 INFO L141 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:35:40,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,116 INFO L141 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:35:40,121 INFO L141 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:35:40,125 INFO L141 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:35:40,129 INFO L141 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:35:40,134 INFO L141 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:35:40,139 INFO L141 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:35:40,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,156 INFO L141 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:35:40,160 INFO L141 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:35:40,165 INFO L141 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:35:40,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,175 INFO L141 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:35:40,180 INFO L141 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:35:40,185 INFO L141 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:35:40,555 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-07-29 01:35:40,794 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-07-29 01:35:40,802 INFO L141 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:35:40,807 INFO L141 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:35:40,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:40,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:41,881 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-07-29 01:35:42,018 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:42,024 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,037 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:35:42,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,102 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:35:42,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,163 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:35:42,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,168 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:35:42,212 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:35:42,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,215 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:35:42,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,255 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:35:42,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:42,304 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:35:42,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,310 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:35:42,336 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:35:42,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,368 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:35:42,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,379 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:35:42,422 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,432 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:35:42,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,471 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:35:42,510 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:35:42,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,518 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:35:42,547 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:35:42,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,551 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:35:42,574 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:35:42,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,579 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:35:42,601 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:35:42,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,612 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:35:42,635 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:35:42,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,640 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:35:42,663 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:35:42,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,669 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:35:42,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:42,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,700 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:35:42,730 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:35:42,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,757 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:35:42,787 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:35:42,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:35:42,834 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:35:42,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:42,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:42,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:42,840 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:35:42,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:35:42,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,909 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:35:42,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,935 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:35:42,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:42,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:42,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:42,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:42,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:42,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:42,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:42,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:43,027 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:35:43,027 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:43,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:43,048 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:43,048 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:43,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2020-07-29 01:35:43,220 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:35:43,229 INFO L393 LassoCheck]: Loop: "call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);" "assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4;" "call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5;" "assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256);" "assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;" "call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);" "assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9;" "cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;" [2020-07-29 01:35:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:43,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2020-07-29 01:35:43,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {92#unseeded} is VALID [2020-07-29 01:35:43,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0 < 1); {92#unseeded} is VALID [2020-07-29 01:35:43,357 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0 < 1); {92#unseeded} is VALID [2020-07-29 01:35:43,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {151#(and unseeded (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:35:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:43,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:43,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {152#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~sc1~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|))) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {172#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {154#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~sc1~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 01:35:43,504 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:35:43,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:43,529 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:35:43,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,535 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:35:43,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:35:43,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2020-07-29 01:35:43,658 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:35:43,659 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:43,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:43,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:43,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:43,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:35:43,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:43,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,668 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:43,671 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:35:43,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:43,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:43,674 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:43,674 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:43,675 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:43,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:43,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:43,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:35:43,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:35:43,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:35:43,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:43,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:43,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:43,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:35:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:35:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:35:43,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:35:43,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:35:43,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:35:43,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:35:43,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:35:43,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:35:43,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:35:43,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:35:43,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:35:43,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:43,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:43,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:43,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:43,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:43,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:43,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:43,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:43,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:43,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:43,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,696 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 01:35:43,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:43,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:35:43,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-29 01:35:43,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:43,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:43,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:43,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-07-29 01:35:43,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:35:43,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:35:43,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:35:43,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:43,705 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:35:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:35:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:35:43,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:43,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:35:43,707 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:35:43,707 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:35:43,708 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:43,711 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:35:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:35:43,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:43,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:43,712 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:35:43,712 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:35:43,713 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:43,715 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:35:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:35:43,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:43,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:43,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:43,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:35:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:35:43,718 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:35:43,718 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:35:43,719 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:35:43,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:35:43,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:43,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:43,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:43,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:43,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:43,722 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 235#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 229#L565 assume !(main_~length1~0 < 1); 230#L565-2 assume !(main_~length2~0 < 1); 228#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 222#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 224#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 237#L555-5 [2020-07-29 01:35:43,722 INFO L796 eck$LassoCheckResult]: Loop: 237#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 231#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 232#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 237#L555-5 [2020-07-29 01:35:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-07-29 01:35:43,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:43,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131799804] [2020-07-29 01:35:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,770 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-07-29 01:35:43,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:43,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948717109] [2020-07-29 01:35:43,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-07-29 01:35:43,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:43,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5236416] [2020-07-29 01:35:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:43,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:43,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:44,380 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2020-07-29 01:35:44,567 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-07-29 01:35:44,569 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:44,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:44,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:44,570 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:44,570 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:44,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:44,570 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:44,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:44,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration3_Lasso [2020-07-29 01:35:44,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:44,570 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:44,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,610 INFO L141 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:35:44,613 INFO L141 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:35:44,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,623 INFO L141 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:35:44,626 INFO L141 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:35:44,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,645 INFO L141 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:35:44,649 INFO L141 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:35:44,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,657 INFO L141 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:35:44,661 INFO L141 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:35:44,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:44,668 INFO L141 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:35:45,062 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2020-07-29 01:35:45,196 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-07-29 01:35:45,209 INFO L141 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:35:45,213 INFO L141 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:35:45,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:35:45,229 INFO L141 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:35:45,233 INFO L141 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:35:45,744 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-07-29 01:35:46,613 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:35:46,737 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:46,737 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) [2020-07-29 01:35:46,751 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:35:46,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,778 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:35:46,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,781 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:35:46,806 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:35:46,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,833 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:35:46,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:46,839 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:35:46,863 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:35:46,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,890 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:35:46,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:46,918 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:35:46,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:46,925 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:35:46,947 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:35:46,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:46,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:46,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:46,950 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:35:46,976 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:35:46,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:46,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:46,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:46,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:46,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:46,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:46,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:47,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:35:47,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:47,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:47,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:47,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:47,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:47,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:47,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:47,017 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:35:47,043 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:35:47,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:47,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:47,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:47,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:47,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:47,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:47,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:47,047 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:35:47,070 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:35:47,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:47,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:47,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:47,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:47,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:47,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:47,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:47,074 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:35:47,096 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:35:47,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:47,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:47,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:47,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:47,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:47,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:47,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:47,100 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:35:47,124 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:35:47,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:47,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:47,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:47,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:47,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:47,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:47,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:47,128 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:35:47,154 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:35:47,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:47,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:47,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:47,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:47,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:47,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:47,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:47,158 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) [2020-07-29 01:35:47,180 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:47,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:47,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:47,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:47,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:47,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:47,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:47,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:47,279 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 01:35:47,279 INFO L444 ModelExtractionUtils]: 34 out of 52 variables were initially zero. Simplification set additionally 15 variables to zero. 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) [2020-07-29 01:35:47,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:47,293 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:47,293 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:47,293 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 Supporting invariants [] [2020-07-29 01:35:47,405 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2020-07-29 01:35:47,408 INFO L393 LassoCheck]: Loop: "call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5;" "assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256);" "assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset;" [2020-07-29 01:35:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,413 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:47,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {329#unseeded} is VALID [2020-07-29 01:35:47,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {329#unseeded} is VALID [2020-07-29 01:35:47,472 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#unseeded} assume !(main_~length1~0 < 1); {329#unseeded} is VALID [2020-07-29 01:35:47,473 INFO L280 TraceCheckUtils]: 3: Hoare triple {329#unseeded} assume !(main_~length2~0 < 1); {329#unseeded} is VALID [2020-07-29 01:35:47,474 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {329#unseeded} is VALID [2020-07-29 01:35:47,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#unseeded} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {329#unseeded} is VALID [2020-07-29 01:35:47,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {329#unseeded} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {329#unseeded} is VALID [2020-07-29 01:35:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:35:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:47,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {332#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {440#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)))} is VALID [2020-07-29 01:35:47,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {440#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {440#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)))} is VALID [2020-07-29 01:35:47,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {440#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {417#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset) (select |#length| ULTIMATE.start_cstrspn_~s~0.base))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:47,511 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:35:47,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:47,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:47,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,523 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:35:47,524 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:35:47,615 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2020-07-29 01:35:47,615 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:35:47,616 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:47,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:47,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:47,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:47,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-07-29 01:35:47,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:47,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,621 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:47,622 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:47,622 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:47,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:47,624 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:47,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:35:47,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:47,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:47,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:47,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:47,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:47,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:47,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:47,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:35:47,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:35:47,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:35:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:47,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:47,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:47,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:47,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:47,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:47,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:47,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:47,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:47,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:47,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:47,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:47,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:47,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:47,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:47,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:47,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:47,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:47,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:47,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,641 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:35:47,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:47,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:35:47,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:35:47,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:47,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:35:47,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:47,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-07-29 01:35:47,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:35:47,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:47,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:35:47,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:47,650 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:35:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:35:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-29 01:35:47,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:47,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:35:47,653 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:35:47,653 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:35:47,654 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:47,656 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:35:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:35:47,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:47,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:47,657 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:35:47,658 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:35:47,658 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:47,661 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:35:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:35:47,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:47,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:47,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:47,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:35:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 01:35:47,664 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:35:47,665 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:35:47,665 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:35:47,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:35:47,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:47,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:47,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:47,667 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:47,667 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:47,667 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 511#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 505#L565 assume !(main_~length1~0 < 1); 506#L565-2 assume !(main_~length2~0 < 1); 504#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 497#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 498#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 514#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 519#L555-1 assume !cstrspn_#t~short7; 518#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 517#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 502#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 503#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 499#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 500#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 513#L555-5 [2020-07-29 01:35:47,667 INFO L796 eck$LassoCheckResult]: Loop: 513#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 507#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 508#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 513#L555-5 [2020-07-29 01:35:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-07-29 01:35:47,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:47,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284743694] [2020-07-29 01:35:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:47,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {645#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-29 01:35:47,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {645#true} is VALID [2020-07-29 01:35:47,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume !(main_~length1~0 < 1); {645#true} is VALID [2020-07-29 01:35:47,759 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume !(main_~length2~0 < 1); {645#true} is VALID [2020-07-29 01:35:47,760 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {645#true} is VALID [2020-07-29 01:35:47,761 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {647#(= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} is VALID [2020-07-29 01:35:47,761 INFO L280 TraceCheckUtils]: 6: Hoare triple {647#(= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {648#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 01:35:47,762 INFO L280 TraceCheckUtils]: 7: Hoare triple {648#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {649#(or (not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) |ULTIMATE.start_cstrspn_#t~short7|)} is VALID [2020-07-29 01:35:47,763 INFO L280 TraceCheckUtils]: 8: Hoare triple {649#(or (not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) |ULTIMATE.start_cstrspn_#t~short7|)} assume !cstrspn_#t~short7; {650#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:47,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {650#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; {650#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:47,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {650#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {651#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 01:35:47,769 INFO L280 TraceCheckUtils]: 11: Hoare triple {651#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {646#false} is VALID [2020-07-29 01:35:47,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {646#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {646#false} is VALID [2020-07-29 01:35:47,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {646#false} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {646#false} is VALID [2020-07-29 01:35:47,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {646#false} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {646#false} is VALID [2020-07-29 01:35:47,770 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:35:47,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284743694] [2020-07-29 01:35:47,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:47,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:35:47,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388775803] [2020-07-29 01:35:47,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:47,772 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-07-29 01:35:47,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:47,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451216353] [2020-07-29 01:35:47,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:47,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:47,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:47,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:47,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:47,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:35:47,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:35:47,910 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:35:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:48,148 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-29 01:35:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:35:48,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:35:48,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:48,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-07-29 01:35:48,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:48,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2020-07-29 01:35:48,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:35:48,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:48,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-07-29 01:35:48,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:48,187 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-29 01:35:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-07-29 01:35:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-29 01:35:48,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:48,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:35:48,189 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:35:48,189 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:35:48,190 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:48,191 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:35:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:35:48,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:48,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:48,192 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:35:48,192 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:35:48,193 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:48,195 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:35:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:35:48,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:48,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:48,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:48,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:35:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-29 01:35:48,197 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:35:48,198 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:35:48,198 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:48,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-07-29 01:35:48,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:48,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:48,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:48,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:48,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:48,200 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 706#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 700#L565 assume !(main_~length1~0 < 1); 701#L565-2 assume !(main_~length2~0 < 1); 699#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 692#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 693#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 709#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 710#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 712#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 711#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 697#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 698#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 694#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 695#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 708#L555-5 [2020-07-29 01:35:48,200 INFO L796 eck$LassoCheckResult]: Loop: 708#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 702#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 703#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 708#L555-5 [2020-07-29 01:35:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-07-29 01:35:48,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:48,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067062350] [2020-07-29 01:35:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,306 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-07-29 01:35:48,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:48,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900794427] [2020-07-29 01:35:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-07-29 01:35:48,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:48,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425898466] [2020-07-29 01:35:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:48,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:48,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:49,279 WARN L193 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 140 [2020-07-29 01:35:49,603 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-07-29 01:35:49,606 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:49,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:49,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:49,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:49,607 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:49,607 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:49,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:49,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:49,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration5_Lasso [2020-07-29 01:35:49,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:49,608 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:49,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:51,090 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2020-07-29 01:35:51,281 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2020-07-29 01:35:51,290 INFO L141 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:35:51,293 INFO L141 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:35:51,297 INFO L141 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:35:51,308 INFO L141 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:35:51,311 INFO L141 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:35:51,314 INFO L141 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:35:51,318 INFO L141 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:35:51,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:51,326 INFO L141 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:35:51,331 INFO L141 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:35:51,334 INFO L141 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:35:51,339 INFO L141 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:35:51,344 INFO L141 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:35:51,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:51,351 INFO L141 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:35:51,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:51,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:51,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:51,365 INFO L141 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:35:51,374 INFO L141 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:35:51,823 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-07-29 01:35:52,117 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-07-29 01:35:52,840 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2020-07-29 01:35:53,072 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-07-29 01:35:53,216 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-29 01:35:53,494 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:53,494 INFO L489 LassoAnalysis]: Using template 'affine'. 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:35:53,502 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:35:53,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:53,504 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:35:53,504 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 01:35:53,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:53,577 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2020-07-29 01:35:53,577 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 01:35:53,787 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:35:53,810 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:35:53,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:53,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:53,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:53,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:53,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:53,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:53,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:53,843 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:35:53,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:53,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:53,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:53,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:53,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:53,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:53,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:35:53,874 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:35:53,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:53,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:53,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:53,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:53,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:53,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:53,881 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:35:53,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:53,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:53,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:53,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:53,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:53,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:53,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:53,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:53,936 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:35:53,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:53,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:53,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:53,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:53,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:53,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:53,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:54,067 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 01:35:54,067 INFO L444 ModelExtractionUtils]: 28 out of 61 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:54,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:54,079 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:54,080 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:54,080 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2020-07-29 01:35:54,382 INFO L297 tatePredicateManager]: 30 out of 32 supporting invariants were superfluous and have been removed [2020-07-29 01:35:54,397 INFO L393 LassoCheck]: Loop: "call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5;" "assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256);" "assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset;" [2020-07-29 01:35:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,408 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:54,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:54,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {840#unseeded} is VALID [2020-07-29 01:35:54,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {840#unseeded} is VALID [2020-07-29 01:35:54,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#unseeded} assume !(main_~length1~0 < 1); {840#unseeded} is VALID [2020-07-29 01:35:54,544 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#unseeded} assume !(main_~length2~0 < 1); {840#unseeded} is VALID [2020-07-29 01:35:54,547 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,559 INFO L280 TraceCheckUtils]: 11: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {1036#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1015#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:54,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1067#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:54,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {1067#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1067#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:54,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {1067#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1018#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:35:54,617 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:35:54,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:54,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:54,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,640 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:54,640 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:54,761 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2020-07-29 01:35:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:54,761 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:54,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:54,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:54,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:54,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:54,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:54,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:54,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:54,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:35:54,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:54,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:54,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:54,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:54,765 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:54,765 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:54,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:54,766 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:54,767 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:54,769 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:54,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:54,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:54,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:54,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:54,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:54,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:54,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:54,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:54,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:54,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:54,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:54,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:54,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:54,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:54,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:54,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:54,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:54,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:54,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:54,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:54,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:54,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:54,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:54,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:54,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:54,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:54,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:54,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,786 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:35:54,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,788 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:54,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {840#unseeded} is VALID [2020-07-29 01:35:54,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {840#unseeded} is VALID [2020-07-29 01:35:54,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#unseeded} assume !(main_~length1~0 < 1); {840#unseeded} is VALID [2020-07-29 01:35:54,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#unseeded} assume !(main_~length2~0 < 1); {840#unseeded} is VALID [2020-07-29 01:35:54,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,898 INFO L280 TraceCheckUtils]: 6: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,902 INFO L280 TraceCheckUtils]: 9: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,906 INFO L280 TraceCheckUtils]: 13: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,906 INFO L280 TraceCheckUtils]: 14: Hoare triple {1142#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1015#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:54,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:54,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1173#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:54,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {1173#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1173#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:54,961 INFO L280 TraceCheckUtils]: 2: Hoare triple {1173#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1018#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:35:54,961 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:35:54,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:54,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:54,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:54,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:54,987 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:54,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:55,084 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2020-07-29 01:35:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:55,084 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:55,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:55,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:55,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:55,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:55,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:55,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:55,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:55,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:35:55,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:55,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:55,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:55,088 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:55,089 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:55,089 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:55,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:55,090 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:55,090 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:55,091 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:55,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:55,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:55,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:55,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:55,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:55,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:55,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:55,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,101 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:35:55,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,102 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:55,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:55,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:55,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {840#unseeded} is VALID [2020-07-29 01:35:55,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {840#unseeded} is VALID [2020-07-29 01:35:55,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#unseeded} assume !(main_~length1~0 < 1); {840#unseeded} is VALID [2020-07-29 01:35:55,200 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#unseeded} assume !(main_~length2~0 < 1); {840#unseeded} is VALID [2020-07-29 01:35:55,202 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,204 INFO L280 TraceCheckUtils]: 7: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,207 INFO L280 TraceCheckUtils]: 11: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,207 INFO L280 TraceCheckUtils]: 12: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,209 INFO L280 TraceCheckUtils]: 14: Hoare triple {1248#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1015#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded)} is VALID [2020-07-29 01:35:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:55,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:55,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:55,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {1016#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1279#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:55,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {1279#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1279#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 01:35:55,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {1279#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1018#(and (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:35:55,256 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:35:55,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:55,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:55,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,278 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:55,278 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:55,411 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2020-07-29 01:35:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:55,411 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:55,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:55,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:55,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:55,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:55,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:55,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:55,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:55,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2020-07-29 01:35:55,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:55,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:55,415 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:55,415 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:55,415 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:55,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:55,417 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:55,417 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:35:55,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:35:55,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:55,417 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:35:55,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:55,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:55,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:55,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:55,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:55,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:55,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:55,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:55,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:55,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:55,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:55,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:55,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,428 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:35:55,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:55,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:35:55,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:35:55,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:55,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:35:55,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:55,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-07-29 01:35:55,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:55,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:55,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:55,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:55,434 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:55,434 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:55,434 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:55,434 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:35:55,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:55,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:55,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:55,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:55 BoogieIcfgContainer [2020-07-29 01:35:55,443 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:55,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:55,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:55,445 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:55,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:38" (3/4) ... [2020-07-29 01:35:55,451 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:55,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:55,455 INFO L168 Benchmark]: Toolchain (without parser) took 18404.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.9 MB). Free memory was 960.2 MB in the beginning and 938.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 419.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:55,457 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:55,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:55,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.69 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:55,462 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:55,463 INFO L168 Benchmark]: RCFGBuilder took 525.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:55,465 INFO L168 Benchmark]: BuchiAutomizer took 17116.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.1 GB in the beginning and 938.0 MB in the end (delta: 134.3 MB). Peak memory consumption was 401.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:55,465 INFO L168 Benchmark]: Witness Printer took 7.56 ms. Allocated memory is still 1.4 GB. Free memory is still 938.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:55,471 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.69 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 525.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17116.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.1 GB in the beginning and 938.0 MB in the end (delta: 134.3 MB). Peak memory consumption was 401.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.56 ms. Allocated memory is still 1.4 GB. Free memory is still 938.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 121 SDslu, 67 SDs, 0 SdLazy, 101 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital274 mio100 ax106 hnf99 lsp100 ukn84 mio100 lsp32 div130 bol100 ite100 ukn100 eq167 hnf78 smp93 dnf643 smp23 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 292ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...